aspiwack / peppermint-proverLinks
Experimental proof assistant (and architecture) for dependent linear logic
☆49Updated 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:
- IO using sized types and copatterns☆36Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 weeks ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- ICFP tutorial☆39Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- ☆51Updated 3 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Miller/pattern unification in Agda☆67Updated 2 weeks ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago