Abstract:
Abadi and Cardelli have recently investigated a calculus of objects. The calculus supports a key feature of object-oriented languages: an object can be emulated by another object that has more refined methods. Abadi and Cardelli presented four first-order type systems for the calculus. The simplest one is based on finite types and no subtyping, and the most powerful one has both recursive types and subtyping. Open until now is the question of type inference, and in the presence of subtyping ``the absence of minimum typings poses practical problems for type inference''.
In this paper
we give an 
algorithm for each of the four type inference problems
and we prove that all the problems are P-complete. We also indicate how to
modify the algorithms to handle functions and records.
Available as PostScript, PDF, DVI.