Charting the progress of the theory, implementation and applications of rewriting models of computation, this study represents a key resource for researchers. A major feature of the book is the presentation of theoretical advances such as a new theory of transfinite term rewriting, a single pushout categorical model of graph rewriting and an abstract interpretation for term graph rewriting.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Illustrationen
Maße
Höhe: 250 mm
Breite: 172 mm
Gewicht
ISBN-13
978-0-471-93567-4 (9780471935674)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Partial table of contents:; How to Get Confluence for Explicit Substitutions (T. Hardin); Graph Rewriting Systems for Efficient Compilation (Z. Ariola & Arvind); Abstract Reduction: Towards a Theory via Abstract Interpretation (M. van Eekelen, et al.); The Adequacy of Term Graph Rewriting for Simulating Term Rewriting (J. Kennaway, et al.); Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence (D. Plump); MONSTR: Term Graph Rewriting for Parallel Machines (R. Banach); Parallel Execution of Concurrent Clean on ZAPP (R. Goldsmith, et al.); Implementing Logical Variables and Disjunctions in Graph Rewrite Systems (P. McBrien); Index.
