From 95609983219f14e8f4c0758cd0688b984d8b1455 Mon Sep 17 00:00:00 2001 From: Helmut Grohne Date: Wed, 5 Feb 2014 15:59:06 +0100 Subject: be more precise about which lookups we use --- Bidir.agda | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'Bidir.agda') diff --git a/Bidir.agda b/Bidir.agda index fae3b9e..8998ec4 100644 --- a/Bidir.agda +++ b/Bidir.agda @@ -141,7 +141,7 @@ theorem-1 G s = begin ≡⟨ cong (h′↦r ∘ just) (lemma-disjoint-union (denumerate s) (get (enumerate s))) ⟩ (h′↦r ∘ just) (fromFunc (denumerate s)) ≡⟨ refl ⟩ - mapMV (flip lookupVec (fromFunc (denumerate s))) (enumerate s) + mapMV (flip lookupM (fromFunc (denumerate s))) (enumerate s) ≡⟨ mapMV-cong (lemma-lookupM-fromFunc (denumerate s)) (enumerate s) ⟩ mapMV (Maybe.just ∘ denumerate s) (enumerate s) ≡⟨ mapMV-purity (denumerate s) (enumerate s) ⟩ @@ -151,7 +151,7 @@ theorem-1 G s = begin where open ≡-Reasoning open Get G h↦h′ = _<$>_ (flip union (delete-many (get (enumerate s)) (fromFunc (denumerate s)))) - h′↦r = flip _>>=_ (flip mapMV (enumerate s) ∘ flip lookupVec) + h′↦r = flip _>>=_ (flip mapMV (enumerate s) ∘ flip lookupM) lemma-<$>-just : {A B : Set} {f : A → B} {b : B} (ma : Maybe A) → f <$> ma ≡ just b → ∃ λ a → ma ≡ just a -- cgit v1.2.3