Towards a full multiple-inheritance virtual machine

Authors:
Roland Ducournau;Floréal Morandat
Affiliations:
LIRMM - Université Montpellier, France;LIRMM - Université Montpellier, France
Venue:
Proceedings of the Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems
Year:
2010

Citing 6
Cited 0

Type-extension type test can be performed in constant time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Bidirectional object layout for separate compilation

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Perfect hashing

Theoretical Computer Science
Perfect hashing as an almost perfect subtype test

ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming in Scala: A Comprehensive Step-by-step Guide

Programming in Scala: A Comprehensive Step-by-step Guide
Empirical assessment of object-oriented implementations with multiple inheritance and static typing

Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Late binding and subtyping create run-time overhead for object-oriented languages, especially in the context of both multiple inheritance and dynamic loading, for instance for Java interfaces. It is, however, generally agreed that the efficiency of Java and .Net systems comes from the fact that, in these languages, classes are in single inheritance. In this paper, we present the abstract architecture of a virtual machine for unrestricted multiple-inheritance, which should provide the same runtime efficiency as Java and .Net.