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:
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated 3 weeks ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- ☆48Updated last week
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Where my everyday research happens☆54Updated 2 months ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year