Abstract
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.
Research work conducted within the framework of Types WG Project IST-1999-29001.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Cardelli, L.: A Theory of Objects. Monographs in Computer Science. Springer, Heidelberg (1996)
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Bono, V.: Extensible Objects: a Tutorial. In: Priami, C. (ed.) GC 2003. LNCS, vol. 2874, pp. 57–87. Springer, Heidelberg (2003)
Bono, V., Bugliesi, M.: Matching for the Lambda Calculus of Objects. Theoretical Computer Science 212(1–2), 101–140 (1999)
Bono, V., Bugliesi, M., Crafa, S.: Typed Interpretations of Extensible Objects. ACM Transactions on Computational Logic 3(4), 562–603 (2002)
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)
Bruce, K.B.: A paradigmatic object-oriented programming language: Design, static typing and semantics. Journal of Functional Programming 4(2), 127–206 (1994)
Bruce, K.B.: Foundations of Object-Oriented Languages–Types and Semantics. The MIT Press, Cambridge (2002)
Bugliesi, M., Pericas, S.: Depth subtyping and type inference for object calculi. Information and Computation 177(1), 2–27 (2002)
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)
Fisher, K., Honsell, F., Mitchell, J.C.: A lambda calculus of objects and method specialization. Nordic Journal of Computing 1(1), 3–37 (1994)
Henglein, F.: Breaking through the n3 barrier: Faster object type inference. Theory and Practice of Object Systems (TAPOS) 5(1), 57–72 (1999)
Hense, A.V.: Polymorphic Type Inference for Object-Oriented Programming Languages. Pirrot Verlag (1994)
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)
Palsberg, J.: Efficient inference of object types. Information and Computation 123(2), 198–209 (1995)
Palsberg, J., Jim, T.: Type inference with simple selftypes is NP-complete. Nordic Journal of Computing 4(3), 259–286 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bono, V., Tiuryn, J., Urzyczyn, P. (2004). Type Inference for Nested Self Types. In: Berardi, S., Coppo, M., Damiani, F. (eds) Types for Proofs and Programs. TYPES 2003. Lecture Notes in Computer Science, vol 3085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24849-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24849-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22164-7
Online ISBN: 978-3-540-24849-1
eBook Packages: Springer Book Archive