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:
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Work on modular implicits☆25Updated 7 years ago
- secret project☆17Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- Example Coq plugin☆18Updated 7 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- A Datalog implementation with an OCaml inspired module system☆42Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- SubML (prototype) language☆23Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 5 years ago
- Tactic for polynomial manipulations☆12Updated 8 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- flexible 'let rec' generation for MetaOCaml☆28Updated last week
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated 3 weeks ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Datatype-generic object-oriented transformations for OCaml☆17Updated 2 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated 2 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years 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
- ☆13Updated 6 years ago
- Lenses in Coq☆17Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- A library of splittable pseudo-random number generators for OCaml☆35Updated last year
- Signatures of the category theoretic style; a experiment in flattery☆25Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago