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:
- 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 tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 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
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A verified compiler for a lazy functional language☆36Updated last week
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated last year