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:
- 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
- IO using sized types and copatterns☆35Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- An infinity-categorical coherence typechecker☆16Updated 6 months ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Work on modular implicits☆24Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A repository of MetaOCaml packages☆12Updated 2 weeks ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 weeks ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- 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
- A tiny implementation of dependent types.☆11Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A discouraging story.☆15Updated 7 years ago
- ☆18Updated 3 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- ☆12Updated 5 years ago