Alternatives and similar repositories for minitt

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

• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆84Updated 4 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 5 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆61Updated 2 weeks ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• frex-project / idris-frex
  ☆51Updated 3 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 6 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆76Updated 7 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 4 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 2 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated last week
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 3 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated last month
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆29Updated last month
• ollef / rock
  Build system
  ☆131Updated last month
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated 2 weeks ago
• wenkokke / setup-agda
  Set up a specific version of Agda for your GitHub Actions workflow.
  ☆28Updated 2 weeks ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆85Updated 4 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated last week