A MONOTONIC SUPERCLASS LINEARIZATION FOR DYLAN PDF
A Monotonic Superclass Linearization for Dylan. Kim Barrett . Bob Cassels [email protected]>. Paul Haahr. In computing, the C3 superclass linearization is an algorithm used primarily to obtain the order It was first published at the OOPSLA conference, in a paper entitled “A Monotonic Superclass Linearization for Dylan”. It was adapted to the. The C3 superclass linearization algorithm is more intuitive and allows for greater monotonicity of method orderings, a consistent superclass linearization.
|Published (Last):||16 November 2017|
|PDF File Size:||17.81 Mb|
|ePub File Size:||13.59 Mb|
|Price:||Free* [*Free Regsitration Required]|
A monotonic superclass linearization for Dylan. View in Source Cite this paper.
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.
A Monotonic Superclass Linearization for Dylan – Semantic Scholar
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 supegclass 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. Linearization Closed-world assumption Computer science Monotonic function Object-oriented programming Clos network Mathematical optimization Merge version control Multiple inheritance.
Steele 1 Estimated H-index: Cited Source Add To Collection. The art of metaobject protocol.
Gregor Kiczales 39 Estimated H-index: The Art of the Metaobject Protocol. Ellis 1 Estimated H-index: Proposal for a monotojic multiple inheritance linearization. Roland Ducournau 4 Estimated H-index: Baker 3 Estimated H-index: Monotonic conflict resolution mechanisms for inheritance. Roland Ducournau 9 Estimated H-index: Object-oriented programming with flavors.
Moon 4 Estimated H-index: Bertrand Meyer 38 Estimated H-index: Mark Stefik 32 Estimated H-index: An information-driven architecture for cognitive systems research. Sebastian Wrede 15 Estimated H-index: Ref Source Add To Collection.
Level-based data sharing for digital content production. Peter Mcnerney 2 Estimated H-index: Preserving and reusing intermediate data. Smyth 2 Estimated H-index: Procedural partitioning of a scene.
Robert Giles Wilson 1 Estimated H-index: Look-based selection for rendering a computer-generated animation. Smyth 1 Estimated H-index: Are you looking for