| | A Monotonic Superclass Linearization for Dylan |
 | | Typically, circular superclass relationships are prohibited, so a hierarchy (or heterarchy, in the case of multiple inheritance) of classes may be modeled as a directed acyclic graph with ordered edges. |
 | | Note that at most one candidate class is in the linearization of each of the direct superclasses, because if two were to appear, one would precede the other due to the constraints and thus the order between them would be determined by the monotonicity requirement. |
 | | Finally, we observe that every predecessor relationship encoded in the linearizations of superclasses used in the merging process comes from one of three sources: a subclass/superclass relationship, the local precedence order of a superclass of C, or one of the augmenting edges from the EPG for a superclass of C. |
| www.webcom.com /haahr/dylan/linearization-oopsla96.html (5476 words) |