On Some Algorithms for Multiple Inheritance in Object-Oriented Programming
On Some Algorithms for Multiple Inheritance in Object-Oriented Programming
复制标题
面向对象程序设计中多重继承的几种算法
DOI：
10.1007/3-540-47891-4_23
复制
发表时间：
1987
影响因子：
2
通讯作者：
M. Habib
中科院分区：
文献类型：
--
作者：
R. Ducournau;M. Habib
我们在这里研究面向对象语言中多重继承产生的一些问题。我们在偏序集合理论的框架内给出了继承机制的解释和形式主义。继承机制可以看作是继承图的遍历算法，我们证明了那些产生线性扩展（全序）的算法起着核心作用。我们讨论了多重继承的一些操作语义方面，引入了多重性的概念。在介绍了一些著名的继承算法之后，我们提出了两种基于深度优先搜索技术和最近研究的一些特定类别的线性扩展的新算法。最后，我们将这些结果应用于有例外的继承情况并设置了一些问题。所有这些结果都是用基于框架的语言YAFOOL实现的。
We study here some problems yielded by multiple inheritance in object-oriented languages. We give an interpretation and a formalism of heritance mechanisms within the framework of partially ordered sets theory. An inheritance mechanism can be regarded as a traversing algorithm of the inheritance graph, and we prove that those which yields linear extension (total order) play a central role.We discuss some operational semantic aspects of multiple inheritance, with the introduction of a concept named by multiplicity. After a presentation of some well-known inheritance algorithms we propose two new algorithms based upon depth-first search techniques and some particular classes of linear extensions, recently studied.We end by applying these results in the case of inheritance with exceptions and by setting a few problems. All these results are implemented in the frame-based language YAFOOL.