Type inference with constraints
These papers explore type inference using constraints.
See also papers about GADTs and about
type families.
-
Let should not be generalised,
Dimitrios Vytiniotis, Simon Peyton Jones, and Tom Schrijvers;
submitted to TLDI 2010.
Abstract.
From the dawn of time, all derivatives of the classic Hindley-Milner type system
have supported implicit generalisation of local let-bindings.
Yet, as we will show, for more sophisticated type systems
implicit let-generalisation imposes a disproportionate complexity
burden.
Moreover, it turns out that the feature is very seldom
used, so we propose to eliminate it.
The payoff is a substantial simplification, both of the specification
of the type system, and of its implementation.