andreasabel / strong-normalization
Formalizations of strong normalization proofs
☆34Updated 5 years ago
Alternatives and similar repositories for strong-normalization:
Users that are interested in strong-normalization are comparing it to the libraries listed below
- IO using sized types and copatterns☆33Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆11Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- Mtac in Agda☆28Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Category theory and algebra☆28Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Specification of Agda.☆25Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Multimode simple type theory as an Agda library.☆22Updated 4 months ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 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
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Logical relations proof in Agda☆26Updated 9 years ago
- Session types in Idris2!☆27Updated 4 years ago