Haskell's popularity has driven the need for ever more expressive type system features [...]. One such feature is the ability to write functions with higher-rank types - that is, functions that take polymorphic functions as their arguments.
The intended audience is quite wide... it's ended up asa tutorial-style paper rather than one intended for type-system insiders.
[draft, via c.l.f]
Posted to teaching/learning by andrew cooke on 7/7/03; 5:06:29 AM
|
|
Practical type inference for arbitrary-rank types
