English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Conference Paper

Graph reducibility of term rewriting systems

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. (1995). Graph reducibility of term rewriting systems. In J. Wiedermann, & P. Hájek (Eds.), Proceedings of Mathematical Foundations of Computer Science (pp. 371-381). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AD02-8
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. However, certain properties of term rewriting systems are not reflected in their graph rewriting implementations. Weak normalization is one such property. An undesirable side effect of this is that it may be impossible to compute a normal form of a normalizable term. In this paper, we present some sufficient conditions for preservation of weak normalization and discuss the implication of the results to modularity.