Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

add syntax for a map that models a property #308

Closed
wants to merge 1 commit into from
Closed

add syntax for a map that models a property #308

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 7 additions & 4 deletions src/Axiom/Set/Map.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -138,8 +138,11 @@ disj-∪ m m' disj = m ˢ ∪ m' ˢ , λ h h' → case ∈⇔P h , ∈⇔P h' of
filterᵐ : {P : A × B → Type} → specProperty P → Map A B → Map A B
filterᵐ sp-P m = filter sp-P (m ˢ) , ⊆-left-unique filter-⊆ (proj₂ m)

syntax filterᵐ sp m = m ⊨ sp
infix 40 filterᵐ

filterᵐ-finite : {P : A × B → Type} → (sp : specProperty P) → Decidable P
→ finite (m ˢ) → finite (filterᵐ sp m ˢ)
→ finite (m ˢ) → finite (m ⊨ sp ˢ)
filterᵐ-finite = filter-finite

filterKeys : {P : A → Type} → specProperty P → Map A B → Map A B
Expand All @@ -159,7 +162,7 @@ module Unionᵐ (sp-∈ : spec-∈ A) where
m ∪ˡ' m' = m ∪ filter (sp-∘ (sp-¬ (sp-∈ {dom m})) proj₁) m'

_∪ˡ_ : Map A B → Map A B → Map A B
m ∪ˡ m' = disj-∪ m (filterᵐ (sp-∘ (sp-¬ sp-∈) proj₁) m')
m ∪ˡ m' = disj-∪ m (m' ⊨ sp-∘ (sp-¬ sp-∈) proj₁)
(∈⇔P -⟨ (λ where x (_ , refl , hy) → proj₁ (∈⇔P hy) (∈⇔P x)) ⟩- ∈⇔P)

disjoint-∪ˡ-∪ : (H : disjoint (dom R) (dom R')) → R ∪ˡ' R' ≡ᵉ R ∪ R'
Expand Down Expand Up @@ -237,10 +240,10 @@ mapValues-dom : {f : B → C} → dom (m ˢ) ≡ᵉ dom (mapValues f m ˢ)
mapValues-dom {m = _ , _} = mapʳ-dom

_∣'_ : {P : A → Type} → Map A B → specProperty P → Map A B
m ∣' P? = filterᵐ (sp-∘ P? proj₁) m
m ∣' P? = m ⊨ sp-∘ P? proj₁

_↾'_ : {P : B → Type} → Map A B → specProperty P → Map A B
m ↾' P? = filterᵐ (sp-∘ P? proj₂) m
m ↾' P? = m ⊨ sp-∘ P? proj₂

constMap : Set A → B → Map A B
constMap X b = mapˢ (_, b) X , λ x x₁ →
Expand Down
2 changes: 1 addition & 1 deletion src/Ledger/Set/Theory.agda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -102,7 +102,7 @@ _ᶠˢ : {A : Set} → ℙ A → FinSet A
X ᶠˢ = X , finiteness _

filterᵐ? : ∀ {A B} {P : A × B → Set} → (∀ x → Dec (P x)) → A ⇀ B → A ⇀ B
filterᵐ? P? = filterᵐ (to-sp P?)
filterᵐ? P? = λ m → m ⊨ (to-sp P?)

filterᵐᵇ : ∀ {A B} → (A × B → Bool) → A ⇀ B → A ⇀ B
filterᵐᵇ P = filterᵐ? (λ x → P x ≟ true)
3 changes: 1 addition & 2 deletions src/Ledger/Transaction.lagda
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -170,8 +170,7 @@ the transaction body are:
txinsVKey txins utxo = txins ∩ dom (utxo ↾' to-sp (isVKeyAddr? ∘ proj₁))

scriptOuts : UTxO → UTxO
scriptOuts utxo = filterᵐ (sp-∘ (to-sp isScriptAddr?)
λ { (_ , addr , _) → addr}) utxo
scriptOuts utxo = utxo ⊨ sp-∘ (to-sp isScriptAddr?) λ { (_ , addr , _) → addr}

txinsScript : ℙ TxIn → UTxO → ℙ TxIn
txinsScript txins utxo = txins ∩ dom (proj₁ (scriptOuts utxo))
Expand Down