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:
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Formalization of Linear Logic☆10Updated 8 years ago
- ☆29Updated 2 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- ☆11Updated 5 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 9 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 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 8 years ago
- Where my everyday research happens☆54Updated last month
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- NbE course @ Chalmers☆28Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- ☆27Updated 5 years ago