Alternatives and similar repositories for nbe-for-mltt:

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

• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 9 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆81Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated 2 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆107Updated 2 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 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.
  ☆81Updated 3 years ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆72Updated 2 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆53Updated 2 years ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆54Updated 4 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆125Updated last year
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆123Updated last year
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆90Updated this week
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆108Updated 2 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆95Updated 3 months ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 5 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆56Updated 7 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆61Updated 2 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆49Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆72Updated 2 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆57Updated 8 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆142Updated 4 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆71Updated 2 years ago