DanilaFe/agda-spa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add a 'set' lattice backed by maps

Browse Source 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
This commit is contained in:
Danila Fedorin
2023-09-23 17:12:12 -07:00
parent 4a90a57388
commit 3c346dcd15
3 changed files with 21 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Lattice/Map.agda
View File

@@ -1,8 +1,6 @@
open import Lattice
open import Relation.Binary.PropositionalEquality as Eq using (_≡_; refl; sym; trans; cong; subst)
open import Relation.Binary.Definitions using (Decidable)
open import Relation.Binary.Core using (Rel)
open import Relation.Nullary using (Dec; yes; no; Reflects; ofʸ; ofⁿ)
open import Agda.Primitive using (Level) renaming (_⊔_ to _⊔ℓ_)
module Lattice.Map {a b : Level} (A : Set a) (B : Set b)
@@ -13,7 +11,7 @@ module Lattice.Map {a b : Level} (A : Set a) (B : Set b)
import Data.List.Membership.Propositional as MemProp
open import Relation.Nullary using (¬_)
open import Relation.Nullary using (¬_; Dec; yes; no)
open import Data.Nat using (ℕ)
open import Data.List using (List; map; []; _∷_; _++_)
open import Data.List.Relation.Unary.All using (All; []; _∷_)