resources for learning Hindley-Milner type inference for undergraduate students

Dear Haskellers, could somebody recommend me study materials for learning Hindley-Milner type inference algorithm I could recommend to undergraduate students? The original paper is harder to understand, I'm looking for something more didactic. The students are familiar with the lambda calculus, natural deduction and System F. Thanks for help, Petr Pudlak

2013/1/18 Petr P
Dear Haskellers,
could somebody recommend me study materials for learning Hindley-Milner type inference algorithm I could recommend to undergraduate students? The original paper is harder to understand, I'm looking for something more didactic. The students are familiar with the lambda calculus, natural deduction and System F.
I think I really liked Cardelli's paper Basic Polymorphic Typechecking, 1987 HTH, Thu

I also agree that Cardelli paper is great.
It was also very useful for me to follow Python implementation provided in the following blog post:
http://www.smallshire.org.uk/sufficientlysmall/2010/04/11/a-hindley-milner-t...
I found it useful to investigate in Python debugger how various terms were interpreted.
You may also find useful implementations in Scala and Perl:
http://dysphoria.net/2009/06/28/hindley-milner-type-inference-in-scala/
http://web.archive.org/web/20050911123640/http://www.cs.berkeley.edu/~nikita...
Also, I have plans to read "Typing Haskell in Haskell" by Mark Jones and "Practical type inference for arbitrary-rank types" by Simon Peyton-Jones et. al. They are also related here, but not directly.
--
Best Regards,
Anton Dergunov
Пятница, 18 января 2013, 11:12 +01:00 от Vo Minh Thu
2013/1/18 Petr P < petr.mvd@gmail.com >:
Dear Haskellers,
could somebody recommend me study materials for learning Hindley-Milner type inference algorithm I could recommend to undergraduate students? The original paper is harder to understand, I'm looking for something more didactic. The students are familiar with the lambda calculus, natural deduction and System F.
I think I really liked
Cardelli's paper Basic Polymorphic Typechecking, 1987
HTH, Thu
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Dnia piątek, 18 stycznia 2013, Petr P napisał:
for learning Hindley-Milner type inference algorithm I could recommend to undergraduate students? The original paper is harder to understand, I'm looking for something more didactic. The students are familiar with the lambda calculus, natural deduction and System F.
Perhaps chapters on H-M from Appel's "Modern compiler implementation in C/Java" would be good? Janek

On Fri, Jan 18, 2013 at 5:49 PM, Jan Stolarek
Dnia piątek, 18 stycznia 2013, Petr P napisał:
for learning Hindley-Milner type inference algorithm I could recommend to undergraduate students? The original paper is harder to understand, I'm looking for something more didactic. The students are familiar with the lambda calculus, natural deduction and System F.
What is the current opinion of Mark Jones Typing haskell in haskell? http://web.cecs.pdx.edu/~mpj/thih/TypingHaskellInHaskell.html [Note This is to add to the question more than the answer]

There is a summary paper by Sunil Kothari and James L. Cladwell
covering the algorithms M, J and W with informal presentations plus
code available in Ocaml. Paper is on Citeseer, code is available from
Sunil Kothari's home page.
Martin Grabmueller has a tutorial implementation of algorithm W in Haskell:
http://www.grabmueller.de/martin/www/pub/pub.en.html
On 18 January 2013 10:06, Petr P
Dear Haskellers,
could somebody recommend me study materials for learning Hindley-Milner type inference algorithm I could recommend to undergraduate students?
participants (6)
-
Anton Dergunov
-
Jan Stolarek
-
Petr P
-
Rustom Mody
-
Stephen Tetley
-
Vo Minh Thu