Experimental proof assistant (and architecture) for dependent linear logic
☆51May 5, 2022Updated 3 years ago
Alternatives and similar repositories for peppermint-prover
Users that are interested in peppermint-prover are comparing it to the libraries listed below
Sorting:
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Sep 22, 2020Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 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
- Edit is a monad for rewriting things.☆23Sep 9, 2020Updated 5 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆16Updated this week
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Feb 22, 2026Updated last week
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Oct 28, 2019Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 11 months ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Design, play with, and analyze sequent calculus proof systems.☆14Sep 5, 2024Updated last year
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- Some tools for provability logic☆37Apr 16, 2018Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- ☆18May 10, 2022Updated 3 years ago