smimram / catt
An infinity-categorical coherence typechecker
☆15Updated 2 weeks ago
Related projects ⓘ
Alternatives and complementary repositories for catt
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- secret project☆17Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆12Updated 5 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- ☆18Updated 2 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 5 years ago
- ☆17Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A repository of MetaOCaml packages☆12Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Session types in Idris2!☆27Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 5 years ago