Alternatives and similar repositories for minitt

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

• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆86Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆122Updated 8 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆64Updated 7 months ago
• 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
• frex-project / idris-frex
  ☆52Updated 5 months ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆54Updated 6 months ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆131Updated 4 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆64Updated last week
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆79Updated 9 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated last month
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆127Updated 10 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆66Updated 5 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 months ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆48Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 5 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated 2 months ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆39Updated last week
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 10 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• ConcreteCactus / lcc
  A compiler that translates a form of lambda calculus to C
  ☆12Updated last year
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• wenkokke / setup-agda
  Set up a specific version of Agda for your GitHub Actions workflow.
  ☆28Updated 2 months ago