Minimal type inference Algorithm W and Algorithm M in F#
-
Updated
Oct 23, 2023 - F#
#
algorithm-w
Here are 9 public repositories matching this topic...
Hindley-Milner type system with extensible records and variants, implemented in Go
-
Updated
Nov 21, 2020 - Go
Simple implementation of ST LC type checker in Haskell
-
Updated
Apr 18, 2022 - Haskell
a typescript version
-
Updated
Sep 26, 2023 - TypeScript
Implementation of Algorithm W
-
Updated
Mar 6, 2019 - OCaml
Simple implementation of Hindley-Milner type inference in Rust
-
Updated
Aug 20, 2024 - Rust
Hindley-Milner type inference (Algorithm W) for a mini-ML in pure Standard ML, with let-polymorphism and an ofLambda bridge to the vendored sml-lambda. Dual-compiler MLton + Poly/ML.
lambda-calculus sml standard-ml type-system hindley-milner type-inference mlton polyml algorithm-w let-polymorphism
-
Updated
Jun 22, 2026 - Standard ML
Pure Standard ML type elaborator: Hindley-Milner Algorithm W over the positioned sml-mlast AST, with principal types, row-polymorphic records, and spanned diagnostics. Byte-identical under MLton and Poly/ML.
-
Updated
Jun 22, 2026 - Standard ML
Improve this page
Add a description, image, and links to the algorithm-w topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the algorithm-w topic, visit your repo's landing page and select "manage topics."