Stefan Kaes

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)
  • 1