ComputingComputer ScienceFormal MethodsProgramming LanguagesSyntaxDomain-specific LanguagesType CheckingType SystemsInheritance HierarchiesMultiple InheritancePolymorphism StudiesStatic PolymorphismSubtypingType Polymorphism
Multiple inheritance has long been plagued with the "diamond" inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we address the diamond problem directly, considering two difficulties it causes: ensuring a correct semantics for object initializers, and typechecking multiple dispatch in a modular fashion-the latter problem arising even with multiple interface inheritance. We show that previous solutions to these problems are either unsatisfactory or cumbersome, and suggest a novel approach: supporting multiple inheritance but forbidding diamond inheritance. Expressiveness is retained through two features: a "requires" construct that provides a form of subtyping without inheritance (inspired by Scala), and a dynamically-dispatched "super" call similar to that found in traits. Through examples, we illustrate that inheritance diamonds can be eliminated via a combination of "requires" and ordinary inheritance. We provide a sound formal model for our language and demonstrate its modularity and expressiveness.
26
Gilad Bracha, William R. Cook · 1990 · 811 citations
Engineering, Systems Engineering, Knowledge Representation +13
Matthew Flatt, Shriram Krishnamurthi, Matthias Felleisen · 1998 · 491 citations · Full text
David Hovemeyer, William Pugh · ACM SIGPLAN Notices · 2004 · 391 citations
William R. Cook, Walter L. Hill, Peter S. Canning · 1990 · 322 citations · Full text