Resurrecting Lennart Augustsson's implementation of Cayenne
☆38Jul 23, 2013Updated 12 years ago
Alternatives and similar repositories for cayenne
Users that are interested in cayenne are comparing it to the libraries listed below
Sorting:
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆58Jun 10, 2020Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- MixML prototype interpreter☆27Dec 13, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Martin-Löf Extensible Specification and Simulator☆29Jul 1, 2015Updated 10 years ago
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- A revival of the TREE-META compiler-compiler.☆15May 15, 2018Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being the notes and materials for CS410 in the 2013/14 academic session☆30May 27, 2014Updated 11 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- A monadic (and pretty) pretty printer for Haskell☆39Jul 12, 2023Updated 2 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Map lazy functional language constructs to LLVM IR☆52Jun 21, 2019Updated 6 years ago