Modular termination of r-consistent and left-linear term rewriting systems

Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz
1995 Theoretical Computer Science  
A modular property of term rewriting systems is one that holds;for the direct sum of two disjoint term rewriting systems iff it holds for every involved term rewriting system. A term rewriting system is r-consistent iff there is no term that can be rewritten to two different variables. We show that the subclass of left-linear and r-consistent term rewriting systems has the modular termination property. This subclass may also contain nonconfluent term rewriting systems. Since confluence implies
more » ... -consistency, this constitutes a generalisation of the theorem of Toyama, Klop, and Barendregt on the modularity of termination for confluent and left-linear term rewriting systems. O304-3975/95/$09.50 0 1995-Elsevier Science B.V. All rights reserved SSDI 0304-3975(95)00080-l
doi:10.1016/0304-3975(95)00080-g fatcat:3a66qxq4jbao5jddrjxj3xyhre