jonsterling / ttLinks
secret project
☆17Updated 7 years ago
Alternatives and similar repositories for tt
Users that are interested in tt are comparing it to the libraries listed below
Sorting:
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- ☆18Updated 3 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A repository of MetaOCaml packages☆12Updated last month
- ☆12Updated 5 years ago
- SubML (prototype) language☆23Updated 3 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 2 months ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- An infinity-categorical coherence typechecker☆17Updated 7 months ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 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
- Work on modular implicits☆24Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Experimental functional language☆17Updated 2 years ago