Modularity of termination in term graph rewriting

Krishna Rao, M. R. K.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Modularity of termination in term graph rewriting

MPS-Authors

/persons/resource/persons44846

Krishna Rao, M. R. K.
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Krishna Rao, M. R. K. (1996). Modularity of termination in term graph rewriting. In H. Ganzinger (Ed.), Rewriting Techniques and Applications (pp. 230-244). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABF0-F

Abstract

Term rewriting is generally implemented using graph rewriting for efficiency reasons. Graph rewriting allows sharing of common structures thereby saving both time and space. This implementation is sound in the sense that computation of a normal form of a graph yields a normal form of the corresponding term. In this paper, we study modularity of termination of the graph reduction. Unlike in the case of term rewriting, termination is modular in graph rewriting for a large class of systems. Our results generalize the results of Plump (1992) and Kurihara and Ohuchi (1995).