ezyang / lr-agdaLinks
Logical relations proof in Agda
☆27Updated 10 years ago
Alternatives and similar repositories for lr-agda
Users that are interested in lr-agda are comparing it to the libraries listed below
Sorting:
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Mtac in Agda☆29Updated 4 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Where my everyday research happens☆56Updated this week
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- a version of the 2048 game for Coq☆22Updated last week
- My master thesis about generic programming and ornaments☆16Updated 9 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- ☆31Updated 11 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- NbE course @ Chalmers☆28Updated last year
- ☆31Updated 2 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- A TACtic library for Agda☆51Updated last year
- being bits and pieces I'm inclined to leave lying around☆56Updated 2 weeks ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- The multimode presheaf proof-assistant☆37Updated 2 weeks ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 5 months ago