andreasabel / strong-normalization
Formalizations of strong normalization proofs
☆34Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for strong-normalization
- Mtac in Agda☆28Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- ☆11Updated 4 years ago
- Specification of Agda.☆25Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 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
- IO using sized types and copatterns☆33Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Category theory and algebra☆27Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆17Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- ☆21Updated 4 months ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Logical relations proof in Agda☆24Updated 9 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
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Compiler backend for generating Scheme code☆26Updated last year