Alternatives and similar repositories for Mini-TT:

Users that are interested in Mini-TT are comparing it to the libraries listed below

• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 3 weeks ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆45Updated 2 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆50Updated 3 years ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated 4 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆29Updated 4 years ago
• frex-project / idris-frex
  ☆47Updated 5 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆56Updated 4 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆29Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆46Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 3 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 8 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆52Updated 7 months ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• jmlowenthal / agda-c
  Verified C programming in Agda
  ☆16Updated 4 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆72Updated 4 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆17Updated 9 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 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.
  ☆81Updated 3 years ago