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:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆23Updated 7 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 4 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- 🌋 Idris implementation of patricia tree☆23Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A simple ML dialect☆11Updated 8 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago