Alternatives and similar repositories for plts:

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

• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last week
• andreypopp / type-systems
  Playing with type systems
  ☆48Updated last month
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆58Updated 7 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆66Updated this week
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆80Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 9 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆109Updated this week
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• Innf107 / vega
  A dependently typed programming language with direct style effects and linearity
  ☆19Updated 6 months ago
• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆21Updated last month
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• Lysxia / advent-of-coq-2021
  ☆40Updated 3 years ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last week
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 4 months ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆60Updated 3 years ago
• wilbowma / pl-thesaurus
  ☆89Updated 3 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last year
• shwestrick / smlfmt
  A custom parser/auto-formatter for Standard ML
  ☆75Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• bor0 / gidti
  Book: Introduction to Dependent Types with Idris
  ☆76Updated last year
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆36Updated 2 months ago
• johnyob / grace
  A fancy diagnostics library that allows your compilers to exit with grace
  ☆71Updated 8 months ago
• vmchale / apple
  Apple array system
  ☆66Updated this week