Alternatives and similar repositories for tt

Users that are interested in tt are comparing it to the libraries listed below

• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• smimram / catt
  An infinity-categorical coherence typechecker
  ☆18Updated last year
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆13Updated 9 years ago
• rlepigre / subml
  SubML (prototype) language
  ☆22Updated 3 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆24Updated 6 years ago
• lpw25 / implicits-module-system
  Work on modular implicits
  ☆25Updated 7 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆39Updated 8 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 7 years ago
• agda-attic / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆45Updated 9 months ago
• JacquesCarette / finally-tagless
  Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
  ☆43Updated 7 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 10 months ago
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• dannywillems / RML
  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
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 7 years ago
• maximedenes / coq-amd64
  ☆21Updated 9 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆26Updated 7 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆18Updated 10 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 11 months ago
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆26Updated 2 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆13Updated 5 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 3 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago