Building A Correct-By-Construction Proof Checkers For Type Theories
☆31Mar 6, 2026Updated this week
Alternatives and similar repositories for McTT
Users that are interested in McTT are comparing it to the libraries listed below
Sorting:
- ☆19Nov 24, 2025Updated 3 months ago
- ☆15Aug 3, 2025Updated 7 months ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Feb 20, 2026Updated 2 weeks ago
- Logical Relation for MLTT in Coq☆30Jan 14, 2026Updated last month
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Rocqet proof language☆28Aug 11, 2025Updated 6 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Jan 23, 2024Updated 2 years ago
- ☆14Feb 26, 2024Updated 2 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Sep 17, 2024Updated last year
- Offline partial evaluation system for Prolog written using the cogen approach☆21Jul 19, 2016Updated 9 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- A verified compiler for a lazy functional language☆39Feb 27, 2026Updated last week
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- ☆15Oct 31, 2023Updated 2 years ago
- Setoid type theory implementation☆40Aug 24, 2023Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- Matita (proof assistant) with embedded elpi☆15Jan 30, 2018Updated 8 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Aug 30, 2022Updated 3 years ago
- GitHub Action using Docker-Coq [maintainers=@Justme0606,@Zimmi48]☆15Mar 23, 2025Updated 11 months ago
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- ☆17Apr 4, 2024Updated last year
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- A formal consistency proof of Quine's set theory New Foundations☆79Feb 25, 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 formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated this week
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago