andreasabel / strong-normalizationLinks
Formalizations of strong normalization proofs
☆35Updated 6 years ago
Alternatives and similar repositories for strong-normalization
Users that are interested in strong-normalization are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- Category theory and algebra☆27Updated 9 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months 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
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆11Updated 5 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- ☆27Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago