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
- Miller/pattern unification in Agda☆64Updated 11 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- The Prettiest Printer☆35Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- ☆39Updated 6 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Pretty-print error messages of the ATS Compiler☆32Updated 5 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Unification and type inference algorithms☆124Updated 10 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆12Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago