New-to-Haskell, i.e. elementary, Haskell questions; extended discussions

headers Petr P | 18 Jan 2013 11:06

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

2013/1/18 Petr P <petr.mvd <at> 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 <at> 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

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

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 <petr.mvd <at> gmail.com> wrote:
>   Dear Haskellers,
>
> could somebody recommend me study materials for learning Hindley-Milner type
> inference algorithm I could recommend to undergraduate students?

Petr Pudlak wrote:
> could somebody recommend me study materials for learning Hindley-Milner
> type inference algorithm I could recommend to undergraduate students? 

Perhaps you might like a two-lecture course for undergraduates, which
uses Haskell throughout

        http://okmij.org/ftp/Haskell/AlgorithmsH.html#teval

It explained HM type inference in a slightly different way, strongly
emphasizing type inference as a non-standard interpretation. The
second main idea was relating polymorphism and `inlining' (copying).
Type schemas were then introduced as an optimization, to inlining. It
becomes clear why it is unsound to infer a polymorphic type for ref
[]: expressions of polymorphic types are always inlined (conceptually,
at least), which goes against the dynamic semantics of reference
cells.

The lectures also show how to infer not only the type but also the
type environment. This inference helps to make the point that `tests'
cannot replace typing. We can type check open expressions (and infer
the minimal environment they make sense to use in). We cannot run
(that is, dynamically check) open expressions.

resources for learning Hindley-Milner type inference for undergraduate students

Re: resources for learning Hindley-Milner type inference for undergraduate students

Re: resources for learning Hindley-Milner type inference for undergraduate students

Re: resources for learning Hindley-Milner type inference for undergraduate students

Re: resources for learning Hindley-Milner type inference for undergraduate students

Re: resources for learning Hindley-Milner type inference for undergraduate students

resources for learning Hindley-Milner type inference for undergraduate students