| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-01-19 | replaced NatMap with FinMap | Helmut Grohne | |
| The domain of the map is always limited. So using Fin n as the domain is natural. Additionally FinMaps are now semantically equal iff their normal form is the same. That means \== can be used. | |||
| 2012-01-19 | first attempt to define bff (with holes) | Helmut Grohne | |
| 2012-01-19 | employ standard library of agda where possible | Helmut Grohne | |
| 2012-01-19 | first attempt to model lemma-1 | Helmut Grohne | |
| Without using the stdlib basic data structures are defined (with the stdlib names in mind). The IntMap given in the paper is translated to a NatMap. There are definitions for checkInsert and assoc resulting in a formalization of lemma-1. | |||
 |
index : ~helmut/bidiragda.git | |
| Bidirectionalization for Free in Agda (http://subdivi.de/~helmut/academia/fsbxia.pdf) | Helmut Grohne |
| summaryrefslogtreecommitdiff |
path: root/Bidir.agda