Alternatives and similar repositories for mlsub:

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

• stedolan / malfunction
  Malfunctional Programming
  ☆346Updated 4 months ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆280Updated 4 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆146Updated 3 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆158Updated this week
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆94Updated last month
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last year
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆143Updated 4 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆157Updated 3 months ago
• mietek / charity-lang
  Charity language interpreters and literature
  ☆114Updated 6 years ago
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆262Updated 9 months ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆258Updated 6 months ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 6 years ago
• ziman / lightyear
  Parser combinators for Idris
  ☆240Updated 5 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆139Updated last month
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated last month
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• racket / redex
  ☆92Updated this week
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated 2 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆79Updated 3 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆80Updated 4 years ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆208Updated 2 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆186Updated 7 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• coq-io / io
  A library for effects in Coq.
  ☆64Updated 2 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆168Updated last week
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆147Updated last year
• pyrocat101 / opal
  Self-contained monadic parser combinators for OCaml
  ☆147Updated last year
• lemmih / lhc
  The LLVM LHC Haskell Optimization System
  ☆199Updated 4 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆136Updated 5 years ago