Algorithm W Step By Step


#1

Algorithm W Step By Step

You can’t really talk about Haskell without mentioning types. Algorithm W is an implementation of Hindley-Milner, which is the basis for Haskell’s type inference engine. This paper contains a very clear implementation (in Haskell) of a type inferencer. A Clojure implementation using this paper exists.