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:
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- An infinity-categorical coherence typechecker☆18Updated 9 months ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 4 months ago
- SubML (prototype) language☆23Updated 3 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last week
- A simple implementation of linear type theory☆38Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 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 6 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Work on modular implicits☆24Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆27Updated last year
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 3 months ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A Coq plugin that implements exceptions in Coq☆14Updated 4 years ago
- ☆17Updated 6 years ago