Confluence and Termination of Simply Typed Term Rewriting Systems

  • Toshiyuki Yamada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2051)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BK86]
    J.A. Bergstra and J.W. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Science, 32:323–362, 1986.MATHCrossRefMathSciNetGoogle Scholar
  2. [BN98]
    F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.Google Scholar
  3. [DJ90]
    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. [Gra96]
    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. [HS86]
    J.R. Hindley and J.P. Seldin. Introduction to Combinators and λ-Calculus. Cambridge University Press, 1986.Google Scholar
  6. [Hue80]
    G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the Association for Computing Machinery, 27(4):797–821, 1980.MATHMathSciNetGoogle Scholar
  7. [JO91]
    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. [Klo80]
    J.W. Klop. Combinatory Reduction Systems. PhD thesis, Rijks-universiteit, Utrecht, 1980.MATHGoogle Scholar
  9. [Klo92]
    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. [MN98]
    R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192:3–29, 1998.MATHCrossRefMathSciNetGoogle Scholar
  11. [NP98]
    T. Nipkow and C. Prehofer. Higher-Order Rewriting and Equational Reasoning, volume I, pages 399–430. Kluwer, 1998.MathSciNetGoogle Scholar
  12. [SMI95]
    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. [vdP94]
    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. [vO97]
    V. van Oostrom. Developing developments. Theoretical Computer Science, 175:159–181, 1997.MATHCrossRefMathSciNetGoogle Scholar
  15. [vR99]
    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. [Zan94]
    H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23–50, 1994.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Toshiyuki Yamada
    • 1
  1. 1.Institute of Information Sciences and ElectronicsUniversity of TsukubaTsukubaJapan

Personalised recommendations