ezyang / lr-agda
Logical relations proof in Agda
☆24Updated 9 years ago
Related projects: ⓘ
- wherein I implement several substructural logics in Agda☆24Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 5 years ago
- Proof automation – for Agda, in Agda.☆43Updated 4 years ago
- ☆11Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Formalization of Linear Logic☆10Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆21Updated 5 years ago
- STLC-related snippets in Agda☆15Updated 11 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 4 years ago
- Formalizing nbe in agda☆30Updated 11 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 5 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆17Updated 11 months ago
- ☆26Updated last year
- Mtac in Agda☆28Updated 3 years ago
- ☆21Updated 2 months ago
- ☆23Updated this week
- ☆14Updated this week
- IO using sized types and copatterns☆33Updated 3 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆19Updated 9 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- ☆30Updated 10 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated last month
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago