Learn More
We present a unified approach to type inference in the presence of overloading and coercions based on the concept of <italic>constrained types</italic>. We define a generic inference system, show that subtyping and overloading can be treated as a special instance of this system and develop a simple algorithm to compute principal types. We prove the(More)
Type systems based on R. Milner’s concept of parametric polymorphism are recognized by the following facts: every well typed program has a uniquely defined denotational semantics, which ensures that the evaluation of a program will never produce a runtime type error. Additionally, every well typed program has a principal type such that every other type is(More)
  • 1