Type Inference for Nested Self Types
We address the issue of the decidability of the type inference problem for a type system of an object-oriented calculus with general selftypes. The fragment considered in the present paper is obtained by restricting the set of operators to method invocation only. The resulting system, despite its syntactical simplicity, is sufficiently complicated to merit the study of the intricate constraints emerging in the process of type reconstruction, and it can be considered as the core system with respect to typability for extensions with other operators. The main result of the paper is the decidability of type reconstruction, together with a certain form of a principal type property.
Unable to display preview. Download preview PDF.
- 2.Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
- 6.Bracha, G., Odersky, M., Stoutamire, D., Wadler, P.: Making the future safe for the past: Adding genericity to the Java programming language. In: Proc. of OOPSLA 1998, vol. 33(10), pp. 183–200 (1998)Google Scholar
- 8.Bruce, K.B.: Foundations of Object-Oriented Languages–Types and Semantics. The MIT Press, Cambridge (2002)Google Scholar
- 10.Di Gianantonio, P., Honsell, F., Liquori, L.: A Lambda Calculus of Objects with Selfinflicted Extension. In: Proc. of ACM-SIGPLAN OOPSLA, pp. 166–178. ACM Press, New York (1998)Google Scholar
- 13.Hense, A.V.: Polymorphic Type Inference for Object-Oriented Programming Languages. Pirrot Verlag (1994)Google Scholar
- 14.Mitchell, J.C.: Toward a typed foundation for method specialization and inheritance. In: Proc. of ACM Symp. POPL, pp. 109–124. ACM Press, New York (1990)Google Scholar