FreeProving / free-compilerLinks
A Haskell to Coq compiler that represents effectful programs with the free monad
☆45Updated 3 years ago
Alternatives and similar repositories for free-compiler
Users that are interested in free-compiler are comparing it to the libraries listed below
Sorting:
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- Mtac in Agda☆28Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- ☆16Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆50Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- NbE course @ Chalmers☆28Updated last year
- Formalizing nbe in agda☆32Updated 12 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago