A Monotonic Superclass Linearization for Dylan (1996)
| Citations: | 32 - 0 self |
BibTeX
@MISC{Barrett96amonotonic,
author = {Kim Barrett and Bob Cassels and Paul Haahr and David A. Moon and Keith Playford and P. Tucker Withington},
title = {A Monotonic Superclass Linearization for Dylan},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Object-oriented languages with multiple inheritance and automatic conflict resolution typically use a linearization of superclasses to determine which version of a property to inherit when several superclasses provide definitions. Recent work has defined several desirable characteristics for linearizations, the most important being monotonicity, which prohibits inherited properties from skipping over direct superclasses. Combined with Dylan’s sealing mechanism, a monotonic linearization enables some compile-time method selection that would otherwise be impossible in the absence of a closed-world assumption. The Dylan linearization is monotonic, easily described, strictly observes local precedence order, and produces the same ordering as CLOS when that is monotonic. We present an implementation based on merging and a survey of class heterarchies from several large programs, analyzing where commonly used linearizations differ.
Keyphrases
monotonic superclass linearization dylan linearization automatic conflict resolution local precedence order closed-world assumption class heterarchies monotonic linearization several large program multiple inheritance several desirable characteristic several superclass direct superclass object-oriented language compile-time method selection recent work
