aspiwack / peppermint-prover
Experimental proof assistant (and architecture) for dependent linear logic
☆47Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for peppermint-prover
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- ☆47Updated last month
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- ICFP tutorial☆40Updated 3 years ago
- A TACtic library for Agda☆48Updated 2 months ago
- Where my everyday research happens☆53Updated last week
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- ☆21Updated 4 months ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- ☆35Updated 3 years ago