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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 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
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Edit is a monad for rewriting things.☆23Sep 9, 2020Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Sep 22, 2020Updated 5 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Dec 13, 2018Updated 7 years 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…☆22Oct 28, 2019Updated 6 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆16Mar 10, 2026Updated 2 weeks 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
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- A collection of small projects to illustrate how to write plugins for Coq☆21Jan 14, 2019Updated 7 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago
- ☆18May 10, 2022Updated 3 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last month
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- A monadic interface for DAG construction.☆24May 11, 2021Updated 4 years ago
- ☆16Feb 18, 2025Updated last year
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- Calculus of Constructions☆18Jul 17, 2019Updated 6 years ago