summaryrefslogtreecommitdiff
path: root/GetTypes.agda
diff options
context:
space:
mode:
authorHelmut Grohne <grohne@cs.uni-bonn.de>2014-02-04 10:32:34 +0100
committerHelmut Grohne <grohne@cs.uni-bonn.de>2014-02-04 10:32:34 +0100
commit257665f2910296c6e87113d2f7a418e1f83b33f6 (patch)
tree5f179250edf342f351d679f263c22d97d6496811 /GetTypes.agda
parente227314c11a17efa2e41ee8756041c4e5b747792 (diff)
parent6eff9c9c93e942ac4bf39cd6d62c0ae0d601c1ae (diff)
downloadbidiragda-257665f2910296c6e87113d2f7a418e1f83b33f6.tar.gz
Merge branch feature-get-record into feature-partial-getlen
These two features heavily interconnect. As such it makes sense to integrate them properly. This non-trivial merge does that work. Compared to feature-partial-getlen a few definitions moved from FreeTheorems.agda to GetTypes.agda. Many types changed compared to both branches. Conflicts: BFF.agda Bidir.agda FreeTheorems.agda Precond.agda conflict in GetTypes.agda not detected by merge
Diffstat (limited to 'GetTypes.agda')
-rw-r--r--GetTypes.agda45
1 files changed, 45 insertions, 0 deletions
diff --git a/GetTypes.agda b/GetTypes.agda
new file mode 100644
index 0000000..a52ec24
--- /dev/null
+++ b/GetTypes.agda
@@ -0,0 +1,45 @@
+module GetTypes where
+
+open import Level using () renaming (zero to ℓ₀)
+open import Data.Nat using (ℕ)
+open import Data.List using (List ; map)
+open import Data.Vec using (Vec) renaming (map to mapV)
+open import Function using (_∘_)
+open import Function.Equality using (_⟶_ ; _⟨$⟩_)
+open import Function.Injection using (module Injection) renaming (Injection to _↪_ ; id to id↪)
+open import Relation.Binary.PropositionalEquality using (_≗_) renaming (setoid to EqSetoid)
+open import Relation.Binary using (Setoid)
+open Injection using (to)
+
+open import Generic using (≡-to-Π)
+
+module ListList where
+ record Get : Set₁ where
+ field
+ get : {A : Set} → List A → List A
+ free-theorem : {α β : Set} → (f : α → β) → get ∘ map f ≗ map f ∘ get
+
+module VecVec where
+ record Get : Set₁ where
+ field
+ getlen : ℕ → ℕ
+ get : {A : Set} {n : ℕ} → Vec A n → Vec A (getlen n)
+ free-theorem : {α β : Set} (f : α → β) {n : ℕ} → get {_} {n} ∘ mapV f ≗ mapV f ∘ get
+
+module PartialVecVec where
+ record Get : Set₁ where
+ field
+ I : Setoid ℓ₀ ℓ₀
+ gl₁ : I ↪ EqSetoid ℕ
+ gl₂ : I ⟶ EqSetoid ℕ
+ get : {A : Set} {i : Setoid.Carrier I} → Vec A (to gl₁ ⟨$⟩ i) → Vec A (gl₂ ⟨$⟩ i)
+ free-theorem : {α β : Set} → (f : α → β) → {i : Setoid.Carrier I} → get {_} {i} ∘ mapV f ≗ mapV f ∘ get
+
+VecVec-to-PartialVecVec : VecVec.Get → PartialVecVec.Get
+VecVec-to-PartialVecVec G = record
+ { I = EqSetoid ℕ
+ ; gl₁ = id↪
+ ; gl₂ = ≡-to-Π getlen
+ ; get = get
+ ; free-theorem = free-theorem
+ } where open VecVec.Get G