Alternatives and similar repositories for vanilla-lang

Users that are interested in vanilla-lang are comparing it to the libraries listed below

• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆66Updated 8 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆112Updated 3 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆133Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 8 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 5 months ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆96Updated 8 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆84Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆113Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated last month
• frex-project / idris-frex
  ☆51Updated 2 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.
  ☆82Updated 4 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 weeks ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆119Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆96Updated 2 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago