Type inference for polymorphic methods in Java-like languages

@inproceedings{Ancona2007TypeIF,
  title={Type inference for polymorphic methods in Java-like languages},
  author={Davide Ancona and Giovanni Lagorio and Elena Zucca},
  booktitle={ICTCS},
  year={2007}
}
In mainstream class-based object-oriented languages with nominal types, like C++, Java and C#, typechecking algorithms require methods to be annotated with their parameter types, which are either fixed or constrained by a (nominal) bound. On the contrary, languages like ML, CaML and Haskell use powerful type inference algorithms capable of calculating the type for a function in which parameter types are left unspecified. This inferred type is possibly polymorphic, hence functions can be applied… CONTINUE READING