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
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- secret project☆17Updated 7 years ago
- A Datalog implementation with an OCaml inspired module system☆42Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- flexible 'let rec' generation for MetaOCaml☆28Updated 4 months ago
- Tactic for polynomial manipulations☆12Updated 7 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- Example Coq plugin☆18Updated 7 years ago
- ☆11Updated 3 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- ☆13Updated 6 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- SubML (prototype) language☆23Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 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
- Generic Programming Library for OCaml☆34Updated 8 years ago
- New version of the PML language and (classical) proof assistant☆21Updated 3 years ago