A verified compiler for a lazy functional language
☆40Mar 13, 2026Updated last week
Alternatives and similar repositories for pure
Users that are interested in pure are comparing it to the libraries listed below
Sorting:
- The Candle theorem prover (fork of the HOL Light sources)☆18Mar 13, 2026Updated last week
- ☆17Apr 4, 2024Updated last year
- Mechanizations of Type Theories☆35Jan 15, 2026Updated 2 months ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- being a particular fragment of Haskell, extended to a proof system☆43Mar 2, 2026Updated 2 weeks ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- ☆14Nov 4, 2025Updated 4 months ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Mar 6, 2026Updated 2 weeks ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 4 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 4 months ago
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- ☆15Aug 3, 2025Updated 7 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- A formal consistency proof of Quine's set theory New Foundations☆81Feb 25, 2026Updated 3 weeks ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 4 months ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- Setoid type theory implementation☆40Aug 24, 2023Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆78Feb 23, 2026Updated 3 weeks ago
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- ♾️ A library for universe levels and universe polymorphism☆37Nov 21, 2025Updated 4 months ago
- Refinement types + dependent types = ❤️☆62Aug 8, 2022Updated 3 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- ☆19Nov 24, 2025Updated 3 months ago
- Algorithms to layout trees in a pretty manner.☆36Mar 7, 2022Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- ☆12Mar 13, 2025Updated last year
- Haskell to D3.js binding by deep EDSL approach.☆23Sep 20, 2014Updated 11 years ago