Premium
An Experiment in Abstract Machine Design
Author(s) -
DIEHL STEPHAN
Publication year - 1997
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199701)27:1<49::aid-spe73>3.0.co;2-d
Subject(s) - unification , computer science , programming language , heap (data structure) , prolog , partial evaluation , feature (linguistics) , extension (predicate logic) , lazy evaluation , theoretical computer science , scheme (mathematics) , representation (politics) , abstract machine , functional programming , mathematics , mathematical analysis , philosophy , linguistics , politics , political science , law
In this article we present Typed Feature Structures as an extension of Prolog, and show how to come up with a compilation scheme and an abstract machine using a design methodology based on partial evaluation. First we define the transformations used by our partial evaluator. Then we present the design methodology which we will use later. Next, we clarify the notion of Typed Feature Structures that underlies our work, and formally define the unification of such structures. Based on this definition, we develop a unification procedure with explicit heap representation. By partially evaluating this procedure with respect to some example programs, we show how to come up with the machine instructions and translation schemes. Finally, we briefly address coreferences, cyclic structures and the unification of types. © 1997 by John Wiley & Sons, Ltd.