Skip to main content
SpringerLink
Log in

Standardization theorem revisited

  • Term Rewriting
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1996)

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

Included in the following conference series:

Abstract

Standardization theorem is one of the most important theory for foundation of computation. Since it was firstly referred to by Curry and Feys, much effort have been made by several researchers. One of the most important work was done by Klop, who brought a nice idea to treat standardization in elegant way. It is called the transformational approach.

In this paper we follow his method but introduce a new labelling method which is suitable for analysys of standardization for term rewriting systems. We show proof of standardization theorem for left-linear term rewriting systems with this labelling method. Furthermore, we also consider a standardization theorem for conditional term rewriting systems. Standardization is possible even for conditional system with extra variables in the right-hand side of rewrite rules. This work is the first result towards standardization of conditional rewrite systems.

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. J.A. Bergstra and J.W. Klop. Conditional rewrite rules. Journal of Computer and System Sciences, 32:323–362, 1986.

    Google Scholar 

  2. G. Boudol. Computational semantics of terms rewriting systems. Technical report, Rapport de recherche INRIA, Feb. 1983.

    Google Scholar 

  3. D. Clark and R. Kennaway. Some properties of non-orthogonal term graph rewriting. Electronic Notes in Theoretical Computer Science, 2, 1995.

    Google Scholar 

  4. H.B. Curry and R. Feys. Combinatory Logic, vol. 1. North-Holand, 1958.

    Google Scholar 

  5. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243–320. North-Holland, 1990.

    Google Scholar 

  6. G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems, I. In J.-L. Lassez and G. Plotkin, editors, Computational Logic, Essays in Honor of Alan Robinson, chapter 11, pages 395–414. The MIT Press, 1991.

    Google Scholar 

  7. J.W. Klop. Combinatory Reduction System. PhD thesis, Rijksuniversiteit Utrecht, 1980.

    Google Scholar 

  8. J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, Vol. II, pages 1–116. Oxford University Press, 1992.

    Google Scholar 

  9. P.-A. Melliès. Description abtraite des systéms de réécriture. PhD thesis, Université. Paris 7, 1996.

    Google Scholar 

  10. A. Middeldorp and E. Hamoen. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:3–21, 1994.

    Google Scholar 

  11. V. van Oostrom. Higher-order families. In International Conference on Rewriting Techniques and Application '96, Lecture Notes in Computer Science, 1996. To Appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Sciences and Electronics and Center for Tsukuba Advanced Research Alliance, University of Tsukuba, 305, Tsukuba, Japan

    Taro Suzuki

Authors
  1. Taro Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Mario Rodríguez-Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suzuki, T. (1996). Standardization theorem revisited. In: Hanus, M., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1996. Lecture Notes in Computer Science, vol 1139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61735-3_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-61735-3_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61735-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation