Skip to main content
SpringerLink
Log in

Confluence and Termination of Simply Typed Term Rewriting Systems

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 2001)

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

Included in the following conference series:

Abstract

We propose simply typed term rewriting systems (STTRSs), which extend first-order rewriting by allowing higher-order functions. We study a simple proof method for con uence which employs a characterization of the diamond property of a parallel reduction. By an application of the proof method, we obtain a new con uence result for orthogonal conditional STTRSs. We also discuss a semantic method for proving termination of STTRSs based on monotone interpretation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

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: Confluence and termination. Journal of Computer and System Science, 32:323–362, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.

    Google Scholar 

  3. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243–320. The MIT Press, 1990.

    Google Scholar 

  4. B. Gramlich. Confluence without termination via parallel critical pairs. In Proceedings of the 21st International Colloquium on Trees in Algebra and Programming, 1996. Lecture Notes in Computer Science 1059, pp. 211–225.

    Google Scholar 

  5. J.R. Hindley and J.P. Seldin. Introduction to Combinators and λ-Calculus. Cambridge University Press, 1986.

    Google Scholar 

  6. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the Association for Computing Machinery, 27(4):797–821, 1980.

    MATH  MathSciNet  Google Scholar 

  7. J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pages 350–361, 1991.

    Google Scholar 

  8. J.W. Klop. Combinatory Reduction Systems. PhD thesis, Rijks-universiteit, Utrecht, 1980.

    MATH  Google Scholar 

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

    Google Scholar 

  10. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192:3–29, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Nipkow and C. Prehofer. Higher-Order Rewriting and Equational Reasoning, volume I, pages 399–430. Kluwer, 1998.

    MathSciNet  Google Scholar 

  12. 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, 1995. Lecture Notes in Computer Science 914, pp. 179–193.

    Google Scholar 

  13. J. van de Pol. Termination proofs for higher-order rewrite systems. In Proceedings of the 1st International Workshop on Higher-Order Algebra, Logic and Term Rewriting, 1994. Lecture Notes in Computer Science 816, pp. 305–325.

    Google Scholar 

  14. V. van Oostrom. Developing developments. Theoretical Computer Science, 175:159–181, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. F. van Raamsdonk. Higher-order rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications, 1999. Lecture Notes in Computer Science 1631, pp. 220–239.

    Google Scholar 

  16. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23–50, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, 305-8573, Japan

    Toshiyuki Yamada

Authors
  1. Toshiyuki Yamada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, 305-8573, Japan

    Aart Middeldorp

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamada, T. (2001). Confluence and Termination of Simply Typed Term Rewriting Systems. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45127-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42117-7

  • Online ISBN: 978-3-540-45127-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation