aspiwack / peppermint-proverLinks
Experimental proof assistant (and architecture) for dependent linear logic
☆51Updated 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:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months 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
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 weeks ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- ☆51Updated 4 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago