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

Add note to self

Browse Source 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
This commit is contained in:
Danila Fedorin 2023-07-14 22:45:17 -07:00
parent cdca2528e9
commit 09d2125aea
1 changed files with 8 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
NatMap.agda
View File

@ -46,3 +46,11 @@ merge f m₁@(x₁@(n₁ , a₁) ∷ xs₁) m₂@(x₂@(n₂ , a₂) ∷ xs₂)
testMerge : merge (_++_) ((1 , "one") ∷ (2 , "two") ∷ []) ((2 , "two") ∷ (3 , "three") ∷ []) ≡ (1 , "one") ∷ (2 , "twotwo") ∷ (3 , "three") ∷ [] testMerge : merge (_++_) ((1 , "one") ∷ (2 , "two") ∷ []) ((2 , "two") ∷ (3 , "three") ∷ []) ≡ (1 , "one") ∷ (2 , "twotwo") ∷ (3 , "three") ∷ []
testMerge = refl testMerge = refl
-- Note to self: will it be tricky to define a Semilattice instance for this?
-- I'm worried because proofs will likely require knowing the ordering -- merge certainly relies on it, but
-- we can't prove commutativity if the NatMap type includes a proof of ordering, because then we'll need
-- to compare `<=` for equality, which are going to be defined in terms of `=`...
--
-- We might need to generalize Lattice and friends to use ≈. But then,
-- pain in the ass for products because they'll need to lift ≈ ...