Technical Reports

The ICICS/CS Reading Room


UBC CS TR-2000-07 Summary

Eliminating Cycles in Composed Class Hierarchies, July 8, 2000 Robert J. Walker, 13 pages

Multiple class hierarchies can be used each to represent a separate requirement or design concern. To yield a working system, these disparate hierarchies must be composed in a semantically meaningful way. However, cycles can arise in the composed inheritance graph that restrict the space of composable hierarchies. This work presents an approach to eliminating these cycles by means of separating the type hierarchy from the implementation hierarchy; separate solutions are provided for languages permitting multiple inheritance, such as C++, and those permitting only interfaces, such as Java. The resulting acyclic class hierarchy will maintain the significant constraints imposed by the original, separate hierarchies, such as type-safety.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.