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
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 5 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 7 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆61Updated 2 weeks ago
• frex-project / idris-frex
  ☆51Updated 4 months ago
• ConcreteCactus / lcc
  A compiler that translates a form of lambda calculus to C
  ☆12Updated last year
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆77Updated 8 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 10 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 5 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated 2 weeks ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆29Updated last week
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆54Updated 5 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 4 months ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 2 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆61Updated last week
• wenkokke / setup-agda
  Set up a specific version of Agda for your GitHub Actions workflow.
  ☆28Updated last month