Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1995: Mathematical Foundations of Computer Science 1995 pp 371–381Cite as

Graph reducibility of term rewriting systems

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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. M. Kurihara and A. Ohuchi (1995), Modularity in noncopying term rewriting, to appear in Theoretical Computer Science.

    Google Scholar 

  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. 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. D. Plump (1993), Evaluation of functional expressions by hypergraph rewriting, Ph.D. Thesis, University of Bremen.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Group, Tata Institute of Fundamental Research Colaba, 400 005, Bombay, India

    M. R. K. Krishna Rao

Authors
  1. M. R. K. Krishna Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Wiedermann Petr Hájek

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rao, M.R.K.K. (1995). Graph reducibility of term rewriting systems. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_143

Download citation

  • DOI: https://doi.org/10.1007/3-540-60246-1_143

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60246-0

  • Online ISBN: 978-3-540-44768-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation