diff options
author | Helmut Grohne <helmut@subdivi.de> | 2012-10-05 12:47:09 +0200 |
---|---|---|
committer | Helmut Grohne <helmut@subdivi.de> | 2012-10-05 12:47:09 +0200 |
commit | 7ba21759412a8b356f7790ac5f5e413302331183 (patch) | |
tree | 58b2f83f1abe029596071e0b151470b122e72102 /FreeTheorems.agda | |
parent | 96e45ecbf31c5685fa914882ec4b21b1392c49fc (diff) | |
download | bidiragda-7ba21759412a8b356f7790ac5f5e413302331183.tar.gz |
move all postulates to one module
This should make it easier to see what is assumed.
Diffstat (limited to 'FreeTheorems.agda')
-rw-r--r-- | FreeTheorems.agda | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/FreeTheorems.agda b/FreeTheorems.agda new file mode 100644 index 0000000..f37cada --- /dev/null +++ b/FreeTheorems.agda @@ -0,0 +1,21 @@ +module FreeTheorems where + +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 Relation.Binary.PropositionalEquality using (_≗_) + +module ListList where + get-type : Set₁ + get-type = {A : Set} → List A → List A + + postulate + free-theorem : (get : get-type) → {α β : Set} → (f : α → β) → get ∘ map f ≗ map f ∘ get + +module VecVec where + get-type : (ℕ → ℕ) → Set₁ + get-type getlen = {A : Set} {n : ℕ} → Vec A n → Vec A (getlen n) + + postulate + free-theorem : {getlen : ℕ → ℕ} → (get : get-type getlen) → {α β : Set} → (f : α → β) → {n : ℕ} → get {_} {n} ∘ mapV f ≗ mapV f ∘ get |