Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Inheritance hierarchies: semantics and unification
Smolka G. (ed), Ait-Kac H. Journal of Symbolic Computation7 (3-4):343-370,1989.Type:Article
Date Reviewed: Mar 1 1990

An inheritance hierarchy is a way of classifying data according to subclasses of objects, as determined by their features. This paper studies the properties of feature types, inheritance, and unification through initial algebra semantics. It suggests that feature types are related to constructor types, which provide a fundamental means of defining data types in algebraic specifications. Features can be interpreted as selecting subclasses from a class of objects, and constructors as defining superclasses. In this way, feature types can be expressed as algebraic types if we supply the implicit constructors.

Two feature terms, or subsets of feature types, may or may not have a common intersection. We can determine such an intersection by feature unification. The paper gives a unitary unification algorithm in the form of rewriting rules in initial algebra semantics. The simplification rules are proved to be invariant, terminating, and complete. In essence, an equation system without implicit constructors is unifiable if and only if a solved system can be derived from it through a finite number of simplification steps.

The paper is an excellent attempt to provide an initial algebra semantics for feature inheritance and to apply the framework to feature unification. One slight problem with the authors’ presentation is that even though they provide vivid examples at the beginning of the paper they do not give examples for more complex subjects.

Reviewer:  T.H. Tse Review #: CR114018
Bookmark and Share
Algebraic Approaches To Semantics (F.3.2 ... )
Abstract Data Types (D.3.3 ... )
General (I.1.0 )
Knowledge Representation Formalisms And Methods (I.2.4 )
Specifying And Verifying And Reasoning About Programs (F.3.1 )
Would you recommend this review?
Other reviews under "Algebraic Approaches To Semantics": Date
A basic abstract semantic algebra
Mosses P.  Semantics of data types (, Sophia-Antipolis, France, Jun 27-29, 1984)1081984. Type: Proceedings
Jun 1 1985
Continuations in possible-world semantics
Tennent R., Tobin J. Theoretical Computer Science 85(2): 283-303, 1991. Type: Article
Sep 1 1992
Basic category theory for computer scientists
Pierce B., MIT Press, Cambridge, MA, 1991. Type: Book (9780262660716)
Nov 1 1993

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy