Term graph rewriting : theory and practice
Author(s)
Bibliographic Information
Term graph rewriting : theory and practice
（Wiley professional computing）
Wiley, c1993
Available at / 23 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
- 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.
by "Nielsen BookData"
