[User's Manual]
[Code]
Efficiently unifying two objects or types, which corresponds to
finding their most general common extension in a partially ordered set
of objects/types, is of central importance for ensuring the efficient
processing of typed feature structures in general. Penn (2000)
shows that every operation necessary for computing the closure of
attributed type signature specifications in the logic of typed feature
structures (Carpenter, 1992) can be reduced to matrix arithmetic.
ALE uses these matrix operations to efficiently compute type
inheritances and least upper bounds at compile time.
of each type