Briefly, what is the difference between Damas-Milner and Hindley-Milner
typing? Are they different inferencing algorithms, or is it something like
the notion of principal types is due to Damas and Milner whereas the
inferencing algorithm itself is due to Hindley and Milner?
It seems to me that I
Hi,
Peter Thiemann writes:
> The type inference algorithm is already presented in Milner's paper
> [Milner1978] along with a soundness proof.
> Damas [DamasMilner1982] proved the completeness of the algorithm and
> the fact that the algorithm computes principal types, i.e., suppose
> the algori
christo> It seems to me that I hear "Damas-Milner" mentioned more often in ML circles,
christo> but "Hindley-Milner" more often with regard to Haskell...
Just briefly adding to Peter Thiemann's explanation, Damas's PhD thesis
also contained a type-system for type-checking impure functional
progr
Briefly, what is the difference between Damas-Milner and Hindley-Milner
typing?
None. They are different names for the same thing.
The actual algorithm was discovered a number of times. Hindley
wrote a history of it, which I don't have to hand. He notes that
it had already been implemente
Frank> Briefly, what is the difference between Damas-Milner and Hindley-Milner
Frank> typing? Are they different inferencing algorithms, or is it something like
Frank> the notion of principal types is due to Damas and Milner whereas the
Frank> inferencing algorithm itself is due t
