FreeProving / free-compiler
A Haskell to Coq compiler that represents effectful programs with the free monad
☆45Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for free-compiler
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Where my everyday research happens☆53Updated last week
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- Mtac in Agda☆28Updated 3 years ago
- Session types in Idris2!☆27Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 2 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Generic functions for single-sorted first-order structural unification☆41Updated this week
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- ☆28Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- Category theory and algebra☆27Updated 8 years ago
- ☆21Updated 4 months ago