csgordon / cayenneLinks
Resurrecting Lennart Augustsson's implementation of Cayenne
☆38Updated 12 years ago
Alternatives and similar repositories for cayenne
Users that are interested in cayenne are comparing it to the libraries listed below
Sorting:
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆57Updated 5 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- ☆39Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 7 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago