Alternatives and similar repositories for practical-type-inference

Users that are interested in practical-type-inference are comparing it to the libraries listed below

• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆26Updated 3 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆53Updated 4 months ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated 3 weeks ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 8 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 8 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• habit-lang / alb
  ☆39Updated 10 months ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆40Updated 6 years ago
• balint99 / sfpl
  A simple functional programming language.
  ☆21Updated 4 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• contificate / match
  Match compilation algorithm in OCaml
  ☆27Updated 4 months ago
• HigherOrderCO / FormCoreJS
  A minimal pure functional language based on self dependent types.
  ☆73Updated 3 years ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 6 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 5 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• codedot / lambda
  Macro Lambda Calculus
  ☆49Updated 6 years ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆70Updated this week
• Superstar64 / aith
  [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…
  ☆62Updated last year
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 4 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆40Updated 6 months ago
• kritzcreek / fby19
  Type inference from scratch - Material for my talk at F(by)19
  ☆64Updated 5 years ago