Formalizations of strong normalization proofs
☆35Jul 8, 2019Updated 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:
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆15Oct 31, 2023Updated 2 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- ☆14Jun 7, 2024Updated last year
- ☆18May 10, 2022Updated 3 years ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- Where my everyday research happens☆56Feb 17, 2026Updated last week
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Oct 14, 2019Updated 6 years ago
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Jun 8, 2025Updated 8 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 3 months ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago