Confluent term rewriting systems with membership conditions
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 x ∈ T' 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.
KeywordsNormal Form Reduction System Critical Pair Termination Property Sufficient Criterion
Unable to display preview. Download preview PDF.
- H.P. Barendregt, The lambda calculus, its syntax and semantics, (North-Holland, 1981).Google Scholar
- J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, J. Comput. and Syst. Sci. 32 (1986) 323–362.Google Scholar
- 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
- S. Kaplan, Conditional rewrite rules, Theoretical Comput. Sci. 33 (1984) 175–193.Google Scholar
- J.W. Klop, Combinatory reduction systems, Dissertation, Univ. of Utrecht, 1980.Google Scholar
- 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
- Y. Toyama, On the Church-Rosser property for the direct sum of term rewriting systems, J. ACM 34 (1987) 128–143.Google Scholar