msprotz / proof-search-monadLinks
Tentative write-up of a neat trick used in the Mezzo type-checker
☆15Updated 9 years ago
Alternatives and similar repositories for proof-search-monad
Users that are interested in proof-search-monad are comparing it to the libraries listed below
Sorting:
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Authenticated Data Structures☆16Updated 10 years ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 8 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last month
- A simple ML dialect☆11Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Label dependent dependent session types☆15Updated last year
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago