Alternatives and similar repositories for nbe-for-mltt

Users that are interested in nbe-for-mltt are comparing it to the libraries listed below

• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 5 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 6 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆84Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 5 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆84Updated 9 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆114Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years 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
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 3 months ago
• frex-project / idris-frex
  ☆51Updated 4 months ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆75Updated 3 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated 3 weeks ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆96Updated 10 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated this week
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆192Updated 8 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆110Updated 10 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆103Updated 4 months ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆76Updated 8 months ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 2 months ago