Skip to main content
SpringerLink
Log in

Conditional term graph rewriting

  • Term Rewriting
  • Conference paper
  • First Online:
Book cover Algebraic and Logic Programming (ALP 1997, HOA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1298))

  • 95 Accesses

Abstract

For efficiency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see [BEG+87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand sides of rules.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc.,21st ACM Symposium on Principles of Programming Languages, pages 268–279, 1994.

    Google Scholar 

  2. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In Proc. Parallel Architectures and Languages Europe, pages 141–152. LNCS 259, 1987.

    Google Scholar 

  3. J.A. Bergstra and J.W. Klop. Conditional Rewrite Rules: Confluence and Termination. Journal of Computer and System Sciences 32(3), pages 323–362, 1986.

    Google Scholar 

  4. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier — The MIT Press, 1990.

    Google Scholar 

  5. M. Hanus. On Extra Variables in (Equational) Logic Programming. Technical Report MPI-I-94-246, Max-Plank-Institut für Informatik, 1994.

    Google Scholar 

  6. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. The Journal of Logic Programming 19,20, pages 583–628, 1994.

    Google Scholar 

  7. M. Hanus. On Extra Variables in (Equational) Logic Programming. In Proceedings of the 12th International Conference on Logic Programming, pages 665–679. MIT Press, 1995.

    Google Scholar 

  8. J.W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1–116. Oxford University Press, 1992.

    Google Scholar 

  9. M. Kurihara and A. Ohuchi. Modularity in Noncopying Term Rewriting. Theoretical Computer Science 152, pages 139–169, 1995.

    Google Scholar 

  10. A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing 5, pages 213–253, 1994.

    Google Scholar 

  11. M.J. O'Donnell. Computing in Systems Described by Equations. LNCS 58, 1977.

    Google Scholar 

  12. D. Plump. Evaluation of Functional Expressions by Hypergraph Rewriting. PhD thesis, Universität Bremen, 1993.

    Google Scholar 

  13. T. Suzuki, A. Middeldorp, and T. Ida. Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, pages 179–193. LNCS 914, 1995.

    Google Scholar 

  14. J. Staples.Church-Rosser Theorems for Replacement Systems. In J. Crosley, editor, Algebra and Logic, pages 291–307. Lecture Notes in Mathematics 450, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Fakultät, University of Bielefeld, P.O. Box 100131, 33501, Bielefeld, Germany

    Enno Ohlebusch

Authors
  1. Enno Ohlebusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Jan Heering Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohlebusch, E. (1997). Conditional term graph rewriting. In: Hanus, M., Heering, J., Meinke, K. (eds) Algebraic and Logic Programming. ALP HOA 1997 1997. Lecture Notes in Computer Science, vol 1298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027008

Download citation

  • DOI: https://doi.org/10.1007/BFb0027008

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63459-1

  • Online ISBN: 978-3-540-69555-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation