Alternatives and similar repositories for dreamtt

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

• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• 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 / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• frex-project / idris-frex
  ☆51Updated 2 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆112Updated 3 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 6 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆58Updated this week
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 weeks ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 4 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 6 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 5 months ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 4 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆71Updated 4 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated last month