返回Google圖書搜尋

Taxon Resolution as a Mechanism for Data Type Derivation

出版	Computer Science Program. University of Missouri-Kansas City, 1989
URL	http://books.google.com.hk/books?id=Bx-XNwAACAAJ&hl=&source=gbs_api

註釋Formal algebraic specifications, used for describing abstract data type semantics, have existed for two decades. Yet two important developments have not yet appeared in most of the literature: a specification language that can handle pragmatic abstract data types (i.e., those with large axiom sets and interface requirements), and programming tools which assist or automate the process of ADT construction. With these developments, the "coding" of ADT's will take place during the design phase in an ultra-high specification language, resulting in increased productivity and reliability. Once an algebraic specification is written, two important types of transformations may be applied to it: those producing a new algebraic specification and those producing source code. New ADT specifications are made by specifying a derivation of the new type which reference existing types. This derivation is a statement of deviations listing all changes to be made to the original types, the parent types. A derivation, therefore, is context dependent, where the context is given by the parent types. Elaboration is the general process of producing a new, context independent specification by integrating the specified deviations in a derivation with the features of the parent types. After first giving a brief overview of the Mason data type derivation system developed by Al Goerner at UMKC, this thesis develops an elaboration algorithm for algebraic specifications. The data structures and principles developed to accomplish this are also fundamental for all translators producing source code via specification transformations