FreeProving / free-compiler
A Haskell to Coq compiler that represents effectful programs with the free monad
☆44Updated 2 years ago
Alternatives and similar repositories for free-compiler:
Users that are interested in free-compiler are comparing it to the libraries listed below
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Session Types with Priority in Linear Haskell☆26Updated 9 months ago
- Where my everyday research happens☆52Updated 3 weeks ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- ☆23Updated 9 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 3 weeks ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated this week
- ☆30Updated 6 years ago