csgordon / cayenne
Resurrecting Lennart Augustsson's implementation of Cayenne
☆38Updated 11 years ago
Alternatives and similar repositories for cayenne:
Users that are interested in cayenne are comparing it to the libraries listed below
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Miller/pattern unification in Agda☆64Updated 11 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- GRIN backend for Idris☆51Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- The Alms Programming Language☆44Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago