csgordon / cayenneLinks
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:
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- xmonad in Coq☆46Updated 13 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year