smimram / catt
An infinity-categorical coherence typechecker
☆16Updated 5 months ago
Alternatives and similar repositories for catt:
Users that are interested in catt are comparing it to the libraries listed below
- secret project☆17Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated last month
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A repository of MetaOCaml packages☆12Updated last year
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago
- ☆12Updated 5 years ago
- ☆18Updated 2 years ago
- ☆17Updated 6 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆37Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 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
- Experimental functional language☆17Updated 2 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 7 months ago
- Work on modular implicits☆24Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 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
- A Dependently Typed Programming Language☆27Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago