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
Sorting:
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- 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
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- The Prettiest Printer☆34Updated last year
- Relative Monad Library for Agda☆24Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Where my everyday research happens☆52Updated last week
- OCaml backend for Agda☆40Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago