Alternatives and similar repositories for mlsub

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

• stedolan / malfunction
  Malfunctional Programming
  ☆350Updated last year
• rossberg / 1ml
  1ML prototype interpreter
  ☆289Updated 5 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆146Updated 5 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆143Updated 6 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆149Updated 4 years ago
• Beluga-lang / Beluga
  Contextual types meet mechanized metatheory!
  ☆203Updated 2 months ago
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆307Updated 3 months ago
• astampoulis / makam
  The Makam Metalanguage
  ☆197Updated 2 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆97Updated last week
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆172Updated this week
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆130Updated last year
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated 2 weeks ago
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆90Updated 6 years ago
• coq-io / io
  A library for effects in Coq.
  ☆65Updated 3 years ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆228Updated 2 years ago
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆271Updated 2 months ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆210Updated 3 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆104Updated 6 months ago
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆382Updated 2 years ago
• Deducteam / Dedukti
  Type-checker for the λΠ-calculus modulo rewriting
  ☆218Updated last week
• gelisam / klister
  an implementation of stuck macros
  ☆149Updated 2 weeks ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆192Updated 8 years ago
• frank-lang / frank
  Frank compiler
  ☆300Updated last year
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆116Updated 4 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• mietek / charity-lang
  Charity language interpreters and literature
  ☆114Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• yallop / fomega
  System Fω interpreter for use in Advanced Functional Programming course
  ☆68Updated 2 years ago