Alternatives and similar repositories for mlsub

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

• rossberg / 1ml
  1ML prototype interpreter
  ☆283Updated 5 years ago
• stedolan / malfunction
  Malfunctional Programming
  ☆350Updated 8 months ago
• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 years ago
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆306Updated 8 months ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆166Updated 2 weeks ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆147Updated 3 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆141Updated 6 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆144Updated 5 years ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆229Updated 2 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆164Updated last month
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆210Updated 3 years ago
• Beluga-lang / Beluga
  Contextual types meet mechanized metatheory!
  ☆195Updated last month
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• coq-io / io
  A library for effects in Coq.
  ☆66Updated 3 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 4 years ago
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆148Updated last year
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆268Updated last year
• gelisam / klister
  an implementation of stuck macros
  ☆144Updated last week
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• frank-lang / frank
  Frank compiler
  ☆295Updated last year
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆95Updated last month
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• RedPRL / cooltt
  😎TT
  ☆230Updated last year
• mietek / charity-lang
  Charity language interpreters and literature
  ☆114Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• ziman / lightyear
  Parser combinators for Idris
  ☆243Updated 6 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆189Updated 7 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆379Updated last year