A verified compiler for a lazy functional language
☆39Feb 20, 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)☆18Feb 13, 2026Updated 2 weeks ago
- ☆14Nov 4, 2025Updated 3 months ago
- Mechanizations of Type Theories☆33Jan 15, 2026Updated last month
- ☆17Apr 4, 2024Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Jan 15, 2026Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 2 weeks ago
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 2 months ago
- Rocqet proof language☆28Aug 11, 2025Updated 6 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 3 years ago
- ☆19Nov 24, 2025Updated 3 months ago
- ☆17Oct 16, 2018Updated 7 years ago
- ☆15Aug 3, 2025Updated 6 months ago
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago
- Algorithms to layout trees in a pretty manner.☆36Mar 7, 2022Updated 3 years ago
- A formal consistency proof of Quine's set theory New Foundations☆79Updated this week
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 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
- Slides for Scalaworld 2019☆15Oct 29, 2020Updated 5 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- ♾️ A library for universe levels and universe polymorphism☆37Nov 21, 2025Updated 3 months ago
- Total Parser Combinators in Agda☆133Aug 5, 2025Updated 6 months 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
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- Refinement types + dependent types = ❤️☆62Aug 8, 2022Updated 3 years ago
- A Teeny Type Theory☆27Jun 4, 2022Updated 3 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 3 months ago