Advertisement

Graph reducibility of term rewriting systems

  • M. R. K. Krishna Rao
Contributed Papers Unification, Rewriting, Type Theory
  • 912 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)

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.

Keywords

Normal Form Normalizable Term Orthogonal System Evaluation Step Parallel Reduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Gauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep (1987), Term graph rewriting, Proc. PARLE'87, Lecture Notes in Computer Science 259, pp. 141–158, Springer-Verlag.Google Scholar
  2. 2.
    B. Courcelle (1990), Graph rewriting: an algebraic and logic approach, In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 193–242, North-Holland.Google Scholar
  3. 3.
    N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 243–320, North-Holland.Google Scholar
  4. 4.
    J.W. Klop (1992), Term Rewriting Systems, tech rep. CS-R9073, CWI, Amsterdam. Also appears as a chapter in S. Abramsky, D. Gabbay and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 2, Oxford Press, 1992.Google Scholar
  5. 5.
    M. Kurihara and A. Ohuchi (1995), Modularity in noncopying term rewriting, to appear in Theoretical Computer Science.Google Scholar
  6. 6.
    D. Plump (1990), Graph-reducible term rewriting systems, Proc. 4th workshop on graph grammars and their applications to Computer Science, Lecture Notes in Computer Science 532, pp. 622–636, Springer-Verlag.Google Scholar
  7. 7.
    D. Plump (1992), Collapsed tree rewriting: completeness, confluence and modularity, Proc. CTRS'92, Lecture Notes in Computer Science 656, pp. 97–112, Springer-Verlag.Google Scholar
  8. 8.
    D. Plump (1993), Evaluation of functional expressions by hypergraph rewriting, Ph.D. Thesis, University of Bremen.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • M. R. K. Krishna Rao
    • 1
  1. 1.Computer Science GroupTata Institute of Fundamental Research ColabaBombayIndia

Personalised recommendations