diff options
author | Helmut Grohne <grohne@cs.uni-bonn.de> | 2014-02-03 14:51:06 +0100 |
---|---|---|
committer | Helmut Grohne <grohne@cs.uni-bonn.de> | 2014-02-03 14:51:06 +0100 |
commit | 39bae2aebe94d04b981e006e33fcf96c86acbf56 (patch) | |
tree | 0225b7dcd6e2122de7fed65cec3cd2bf55bbc68b /BFF.agda | |
parent | 26e2fea33aae257440e5571fb3f7e784938403e0 (diff) | |
parent | 6eff9c9c93e942ac4bf39cd6d62c0ae0d601c1ae (diff) | |
download | bidiragda-39bae2aebe94d04b981e006e33fcf96c86acbf56.tar.gz |
Merge branch feature-get-record into master
This branch brings three main benefits:
* Only one explicit parameter is needed to ask for a get function.
* The postulated free theorems are mostly turned into preconditions,
i.e. the only use of the postulates is in LiftGet.
* We can now convert list based get functions to vec based ones and back
including the (now) accompanying free theorem.
Diffstat (limited to 'BFF.agda')
-rw-r--r-- | BFF.agda | 10 |
1 files changed, 5 insertions, 5 deletions
@@ -16,10 +16,10 @@ open import Relation.Binary using (DecSetoid ; module DecSetoid) open import FinMap open import Generic using (mapMV) import CheckInsert -import FreeTheorems +import GetTypes module VecBFF (A : DecSetoid ℓ₀ ℓ₀) where - open FreeTheorems.VecVec public using (get-type) + open GetTypes.VecVec public using (Get) open module A = DecSetoid A using (Carrier) renaming (_≟_ to deq) open CheckInsert A @@ -33,9 +33,9 @@ module VecBFF (A : DecSetoid ℓ₀ ℓ₀) where denumerate : {n : ℕ} → Vec Carrier n → Fin n → Carrier denumerate = flip lookupV - bff : {getlen : ℕ → ℕ} → (get-type getlen) → ({n : ℕ} → Vec Carrier n → Vec Carrier (getlen n) → Maybe (Vec Carrier n)) - bff get s v = let s′ = enumerate s - t′ = get s′ + bff : (G : Get) → ({n : ℕ} → Vec Carrier n → Vec Carrier (Get.getlen G n) → Maybe (Vec Carrier n)) + bff G s v = let s′ = enumerate s + t′ = Get.get G s′ g = fromFunc (denumerate s) g′ = delete-many t′ g h = assoc t′ v |