Re:What is Hindley-Milner and why is it cool? (2008)
by igravious on Monday August 21, 2017 @01:23AM
(#15062140)
Why are they capable of inferring much more complex types? Which sort of types can Hindley-Milner infer – what sort of types can Pierce-Turner and Dunfield-Krishnaswami respectively infer? Which programs still can't be typed using the latter method?
[ Parent
| on HN ]
Re:What is Hindley-Milner and why is it cool? (2008)
by tel on Monday August 21, 2017 @06:58AM
(#15063562)
Dunfield-Krishnaswami handles higher ranked polymorphism but is probably most famous for just being a very nice presentation of bidirectional typechecking. Algorithm W (Hindley-Milner) is only able to infer first-order polymorphism occurring at generalization points (usually "let"s).