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:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆47Updated 3 weeks ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- ☆36Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Mtac in Agda☆28Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated last month
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆23Updated 11 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago