An object addressing mechanism for statically typed languages with multiple inheritance
- 1 September 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 24 (10) , 279-285
- https://doi.org/10.1145/74877.74906
Abstract
In this paper we are concerned with addressing techniques for statically typed languages with multiple inheritance. The addressing techniques are responsible for the efficient implementation of record field selection. In object-oriented languages, this record selection is equivalent to the access of methods. Thus, the efficiency of these techniques greatly affects the overall performance of an object-oriented language. We will demonstrate that addresses, in such systems, cannot always be calculated statically and show how symbol tables have been used as address maps at run time. The essence of the paper is a new addressing technique that can statically calculate either the address of a field or the address of the address of the field. This technique is powerful enough to support an efficient implementation of multiple inheritance with implicit subtyping as described by Cardelli.Keywords
This publication has 4 references indexed in Scilit:
- Inheritance as an Incremental Modification Mechanism or What Like Is and Isn’t LikePublished by Springer Nature ,1988
- Procedures as persistent data objectsACM Transactions on Programming Languages and Systems, 1985
- A semantics of multiple inheritanceLecture Notes in Computer Science, 1984
- An Approach to Persistent ProgrammingThe Computer Journal, 1983