aspiwack / peppermint-prover
Experimental proof assistant (and architecture) for dependent linear logic
☆47Updated 2 years ago
Alternatives and similar repositories for peppermint-prover:
Users that are interested in peppermint-prover are comparing it to the libraries listed below
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- ☆47Updated 3 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated this week
- A TACtic library for Agda☆48Updated 6 months ago
- A verified compiler for a lazy functional language☆34Updated last month
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 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
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago