smimram / cattLinks
An infinity-categorical coherence typechecker
☆18Updated last year
Alternatives and similar repositories for catt
Users that are interested in catt are comparing it to the libraries listed below
Sorting:
- Work on modular implicits☆25Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- secret project☆17Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last week
- An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
- SubML (prototype) language☆23Updated 3 years ago
- A Datalog implementation with an OCaml inspired module system☆42Updated 7 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- Example Coq plugin☆18Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- Coq library for handling names☆19Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Tactic for polynomial manipulations☆12Updated 6 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- Generic Programming Library for OCaml☆34Updated 8 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated last week
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆12Updated 5 years ago
- flexible 'let rec' generation for MetaOCaml☆27Updated 3 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Efficient binder representation in OCaml☆43Updated last year