Building A Correct-By-Construction Proof Checkers For Type Theories
☆36Aug 5, 2026Updated 2 months ago
Alternatives and similar repositories for McTT
Users that are interested in McTT are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Logical Relation for MLTT in Coq☆35Apr 7, 2026Updated 6 months ago
- ☆14Feb 26, 2024Updated 2 years ago
- ☆22Jul 2, 2026Updated 3 months ago
- ☆16Aug 3, 2025Updated last year
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37May 18, 2026Updated 4 months ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Mechanizations of Type Theories☆37Aug 11, 2026Updated 2 months ago
- ☆14Aug 5, 2026Updated 2 months ago
- Contextual types meet mechanized metatheory!☆213Sep 30, 2025Updated last year
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Nov 19, 2022Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆77Sep 4, 2026Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆60Sep 11, 2025Updated last year
- Mechanizing Types and Programming Languages using Beluga☆24May 29, 2020Updated 6 years ago
- Tutorial for refinement based verification☆20Sep 15, 2026Updated last month
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆16Jan 23, 2024Updated 2 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Linearizability Hoare Logic☆18Sep 16, 2026Updated last month
- Lenses in Coq☆17Oct 7, 2022Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆15Jan 30, 2018Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆91Oct 15, 2025Updated last year
- A formalization of the theory behind the mugen library☆20Jul 5, 2026Updated 3 months ago
- Formalization of the Dependent Object Types (DOT) calculus☆67Aug 30, 2022Updated 4 years ago
- Intrinsic Verification of Formal Grammar Theory☆28Aug 4, 2026Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆39Jun 19, 2026Updated 3 months ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 3 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆28Sep 30, 2026Updated 2 weeks ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 4 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆28Apr 22, 2022Updated 4 years ago
- ☆10Nov 20, 2023Updated 2 years ago
- End-to-end Verified Polyhedral Compilation☆25Sep 7, 2026Updated last month
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆33Oct 22, 2024Updated last year
- The Penn Locally Nameless Metatheory Library☆80Mar 26, 2025Updated last year
- ☆16Oct 31, 2023Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- Adding extensions to DOT calculus☆24Jan 19, 2020Updated 6 years ago
- ☆16Sep 23, 2026Updated 3 weeks ago
- Rocqet proof language☆29Aug 11, 2025Updated last year
- A verified compiler for a lazy functional language☆45Oct 3, 2026Updated 2 weeks ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆18Jan 5, 2015Updated 11 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 3 years ago