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 8 months ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆285Updated 5 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆145Updated 5 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆148Updated 3 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆165Updated last month
• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 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
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆307Updated 9 months ago
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆270Updated last year
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆148Updated last year
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated last month
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• Beluga-lang / Beluga
  Contextual types meet mechanized metatheory!
  ☆195Updated 2 months ago
• pyrocat101 / opal
  Self-contained monadic parser combinators for OCaml
  ☆148Updated 2 years 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
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆96Updated 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
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆102Updated 2 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆144Updated last month
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆229Updated 2 years ago
• rossberg / hamlet
  SML reference interpreter
  ☆116Updated this week
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years 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 3 years ago
• Deducteam / Dedukti
  Implementation of the λΠ-calculus modulo rewriting
  ☆214Updated 3 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago