Multiple Inheritance
Derek Capper · 1994
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 8,511 papers for “Multiple inheritance”
Derek Capper · 1994
Cited by 0
Amit Patel, Vitaly Shmatikov, John Mitchell · 2007
In this paper, we demonstrate that multiple inheritance can be expressed as a combination of single inheritance, parameterization, and interface subtyping. We propose a language construct called "phunctor" as an alternative to multiple inheritance. Phunctors combine single inheritance and constrained parameterization to provide required functionality in the contexts where multiple inheritance is used, while retaining the benefits of static type checking. We argue that using parameterized inheritance instead of multiple inheritance leads to more robust class hierarchy designs. We discuss how phunctors can be implemented efficiently and show that phunctors facilitate several common design patterns.
Cited by 0
Ny Munkegade, Erik Ernst, Erik Ernst · 2002
Abstract. Combination of descriptive entities—i.e. multiple inheritance and related mechanisms—is usually only supported at compile time in statically typed languages. The language gbeta is statically typed and has supported run-time creation of classes and methods since 1997, by means of the pattern combination operator ‘&’. However, with certain combinations of operands the ‘& ’ operator fails; as a result, creation of new classes and methods at run-time had to be considered a dangerous operation. This paper presents a large and useful class of combinations, and proves that combinations in this class will always succeed. 1
Cited by 0
CP Willis · Software Engineering Journal · 1996
Some of the more common descriptions of inheritance, and particularly multiple inheritance are analysed; these are frequently unclear and even contradictory in much of the published literature. Using abstract data types to provide examples, it is shown how a consistent basis for inheritance and multiple inheritance may be built up, which helps to clarify the true meaning of inheritance.
Cited by 16
Dov Dori, Erez Tatcher · IEEE Software · 1994
In conventional multiple inheritance, a class must inherit features from all its ancestors. With this proposed generalized method, you can use an embryonic class, in which the classes themselves are instances, to select ancestor subsets without creating a combinatorial explosion in the object diagram.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 11
Eva Jablonka, Marion J. Lamb · 1995
Abstract In 1958, the centenary of the first publication of Darwin and Wallace’s theory of evolution by natural selection, Donald Michie expressed the opinion that the ‘third stage’ in genetics had arrived. The first stage was that of classical Mendelian genetics, dominated by Johannsen’s genotype concept and the chromosomal theory. The second stage, which began in the post-war period, was the incorporation of the inheritance of cytoplasmic factors into genetics; it was recognized that there are cytoplasmic inheritance systems which can transmit epigenetic information germinally. The third stage, which, according to Michie, was just dawning in 1958, was a synthesis of these two: the acceptance that DNA and the cytoplasm are not independent, and that there are persistent interactions between them (Fig. 10.1).
Cited by 0
Roderick, T H, Gunther Schlager · The Mouseion at the JAXlibrary (Jackson Laboratory) · 1966
Cited by 3
Eric E. Allen, Joseph J. Hallett, Victor Luchangco et al. · 2007
Overloaded functions and methods with multiple dispatch are useful for extending the functionality of existing classes in an object-oriented language. However, such functions introduce the possibility of ambiguous calls that cannot be resolved at run time, and modular static checking that such ambiguity does not exist has proved elusive in the presence of multiple implementation inheritance. We present a core language for defining overloaded functions and methods that supports multiple dispatch and multiple inheritance, together with a set of restrictions on these definitions that can be statically and modularly checked. We have proved that these restrictions guarantee that no undefined nor ambiguous calls occur at run time, while still permitting various kinds of overloading.
Cited by 24
James Hendler · 1986
Article Enhancement for multiple-inheritance Share on Author: James Hendler Department of Computer Science, University of Maryland, College Park, Maryland Department of Computer Science, University of Maryland, College Park, MarylandView Profile Authors Info & Claims OOPWORK '86: Proceedings of the 1986 SIGPLAN workshop on Object-oriented programmingJune 1986 Pages 98–106https://doi.org/10.1145/323779.323748Online:01 June 1986Publication History 18citation276DownloadsMetricsTotal Citations18Total Downloads276Last 12 Months8Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Cited by 8
Erik Ernst · DAIMI Report Series · 2002
Combination of descriptive entities--i.e. multiple inheritance and related mechanisms--is usually only supported at compile time in statically typed languages. The language gbeta is statically typed and has supported run-time creation of classes and methods since 1997, by means of the pattern combination operator '&amp;'. However, with certain combinations of operands the '&amp;' operator fails; as a result, creation of new classes and methods at run-time had to be considered a dangerous operation. This paper presents a large and useful class of combinations, and proves that combinations in this class will always succeed.
Cited by 6Open access
Stevan J. Arnold · 2023
Abstract The G-matrix provides a useful way to model inheritance when multiple traits are affected by many genes and genetically coupled. The G-matrix is an m trait × m trait table with genetic variances on its main diagonal and genetic covariances elsewhere. The genetic covariance between two traits summarizes genetic connections arising from linkage disequilibrium and/or pleiotropy. Studies of multiple trait inheritance often reveal appreciable genetic correlations between traits, especially when those traits are size-related. The M-matrix summarizes the patterns of mutational effects on multiple traits. Just as covariances among relatives are the foundation for estimation of the G-matrix, the accumulation of mutations in inbred lines is the foundation for estimation of the M-matrix. Studies of G- and M-matrices suggest that these matrices have almost as many dimensions of variation as the number of characters included in the study. Consequently, these matrices are unlikely to constrain the course of evolution on long evolutionary timescales. The entire G-matrix, as well as its constituent genetic variances and covariances, can be visualized as achieving a stable balance between opposing forces. This stable equilibrium represents a compromise between alternative structures imposed by the processes of selection, mutation, recombination, and migration.
Cited by 0
Khoerul Anwar · Jurnal Teknologi Informasi · 2011
Multiple inheritance is the ability of the class to provide more of a super class. Multiple inheritance in a programming language to support a program to be structured as a collection of inheritance lattice of a collection of inheritance tree. Multiple inheritance recognized to be an important structuring tool. It is as well as the recognition that multiple inheritance is a fairly difficult / complex in a programming language, is difficult to implement, and costly to run. Here the authors will try to explain that none of the three estimates are true. Keywords: Multiple Inheritance, Super Class
Cited by 0Open access
R. Ducournau, M. Habib, M. Huchard et al. · 2008
Previous studies concerning multiple inheritance convinced us that a better analysis of conflict res-olution mechanisms was necessary. In [DHHM92], we stated properties that a sound mechanism has to respect. Among them, a monotonicity princi-ple plays a critical role, ensuring that the inher-itance mechanism behaves “naturally ” relative to the incremental design of the inheritance hierar-chy. We focus here on linearizations and present an intrinsically monotonic linearization, whereas currently used linearizations are not. This paper describes the algorithm in detail, explains the de-sign choices, and compares it to other lineariza-tions, with LOOPS and CLOS taken as references. In particular, this new linearization extends CLOS and LOOPS linearizations, producing the same re-sults when these linearizations are sound. tPlease send correspondence concerning this paper to M. Habib. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title Of the publication and its date appear, and notice is given
Cited by 0
Eric Allen, J. J. Hallett, Victor Luchangco et al. · 2008
Overloaded functions and methods with multiple dispatch are useful for extending the functionality of existing classes in an objectoriented language. However, such functions introduce the possibility of ambiguous calls that cannot be resolved at run time, and modular static checking that such ambiguity does not exist has proved elusive in the presence of multiple implementation inheritance. We present a core language for defining overloaded functions and methods that supports multiple dispatch and multiple inheritance, together with a set of restrictions on these definitions that can be statically and modularly checked. We have proved that these restrictions guarantee that no undefined nor ambiguous calls occur at run time, while still permitting various kinds of overloading.
Cited by 0
Luca Cardelli · Information and Computation · 1988
Cited by 625
E. C. MacDowell · Journal of Experimental Zoology · 1914
Since cases of simple Mendelian phenomena have been very frequently described, the interest of the student of genetics has shifted from the attempt to prove, or disprove, Mendelism towards the investigation of the extent of the application of Mendel's fundamental principles.Perhaps this is why the apparent exclusion of anything Mendelian from size inheritance by Castle's work on the ear length of rabbits, aroused so much interest.Castle ('09) found that the ear lengths of rabbit offspring were in general'intermediate in relation to the parents.This seemed to indicate a simple blending inheritance in which the size-controlliig elements from either parent were permanently joined in the offspring, never to segregate.Yet in the same rabbits Mendelian ratios were being given and segregation was taking place in the color of the hair.The appearance of a paper by H.Nilsson-Ehle ('09) brought a new possible interpretation of the ear length crosses.In this paper evidence was presented to show that there may be two or more Mendelian factors for the same character, which factors develop the character whether they appear alone or in any combination with the others.Nilsson-Ehle found in certain crosses of oats and wheat in which the colors of the glumes and seeds were considered, that simple Mendelian ratios (3 : 1) were generally given, but in cer-This paper is based on an investigation carried on in the Laboratory of Genetics of the Bussey
Cited by 29Open access
Ewan Tempero, Robert Biddle · Journal of Systems and Software · 2000
Cited by 25
Graeme Trousdale · Benjamins current topics · 2015
Language as a network of dependencies or constructions is a central feature of many cognitive theories of grammar. In this network, inheritance relationships are used to describe synchronic facts about a language whereby members of a less abstract set inherit properties from a more general set, and in the case of multiple inheritance, from more than one general set. This article explores some of the ways in which the language network may change over time, particularly the ways in which more than one constructional type may be considered to be the source of a change in the network.
Cited by 31
Ducournau, Roland, Habib, Michel, Huchard, Marianne et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1992
Available at INIST (FR), Document Supply Service, under shelf-number : RP 11881 / INIST-CNRS - Institut de l'Information Scientifique et Technique
Cited by 0
Alexander Velikiy, V.A. Savel’ev, V.V. Tihonenko · Institutional Repository National Mining University of Ukraine (National Mining University of Ukraine) · 2017
Cited by 0Open access