Confluent term rewriting systems with membership conditions

  • Yoshihito Toyama
Part 1 Research Articles
Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)


We propose a new type of conditional term rewriting system: the membership-conditional term rewriting system, in which, each rewriting rule can have membership conditions which restrict the substitution values for the variables occurring in the rule. For example, the rule f(x, x, y) ▹ g(x, y) if xT' yields the reduction f(M, M, N) → g(M, N) only when M is in the term set T'. Thus, by using membership-conditional rewriting, we can easily provide a strategy for term reduction. We study the confluence of membership-conditional term rewriting systems that are nonterminating and nonlinear. It is shown that a restricted nonlinear term rewriting system in which membership conditions satisfy the closure and termination properties is confluent if the system is nonoverlapping.


Normal Form Reduction System Critical Pair Termination Property Sufficient Criterion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H.P. Barendregt, The lambda calculus, its syntax and semantics, (North-Holland, 1981).Google Scholar
  2. [2]
    J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, J. Comput. and Syst. Sci. 32 (1986) 323–362.Google Scholar
  3. [3]
    G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. ACM 27 (1980) 797–821.CrossRefGoogle Scholar
  4. [4]
    G. Huet and D.C. Oppen, Equations and rewrite rules: a survey, in: R.V. Book, ed., Formal languages: perspectives and open problems, (Academic Press, 1980) 349–405.Google Scholar
  5. [5]
    J.-P. Jouannaud and H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. COMPUT. 15 (1986) 1155–1194.CrossRefGoogle Scholar
  6. [6]
    S. Kaplan, Conditional rewrite rules, Theoretical Comput. Sci. 33 (1984) 175–193.Google Scholar
  7. [7]
    J.W. Klop, Combinatory reduction systems, Dissertation, Univ. of Utrecht, 1980.Google Scholar
  8. [8]
    D.E. Knuth and P.G. Bendix, Simple word problems in universal algebras, in: J. Leech, ed., Computational problems in abstract algebra (Pergamon Press, 1970) 263–297.Google Scholar
  9. [9]
    B.K. Rosen, Tree-manipulating systems and Church-Rosser theorems, J. ACM 20 (1973) 160–187.CrossRefGoogle Scholar
  10. [10]
    Y. Toyama, On the Church-Rosser property for the direct sum of term rewriting systems, J. ACM 34 (1987) 128–143.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Yoshihito Toyama
    • 1
  1. 1.NTT Basic Research LaboratoriesTokyoJapan

Personalised recommendations