Alternatives and similar repositories for tt:

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

• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 4 years ago
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated 6 months ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 2 weeks ago
• smimram / catt
  An infinity-categorical coherence typechecker
  ☆16Updated 5 months ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated last year
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• yallop / metaocaml-letrec
  flexible 'let rec' generation for MetaOCaml
  ☆26Updated last year
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• JacquesCarette / finally-tagless
  Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
  ☆43Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• umazalakain / session-types-coq
  Formalising session types in Coq
  ☆17Updated 5 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 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) -…
  ☆12Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 4 months ago
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆26Updated last year
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 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.
  ☆37Updated 2 years ago
• jmchapman / TT-in-TT
  Type theory in type theory
  ☆16Updated 13 years ago