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:
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Where my everyday research happens☆56Updated this week
- Mtac in Agda☆29Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 2 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- ☆52Updated 5 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago