Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems

• Published 1995 in Theor. Comput. Sci.

Abstract

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 r-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.

DOI: 10.1016/0304-3975(95)00080-G

Cite this paper

@article{SchmidtSchau1995ModularTO, title={Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems}, author={Manfred Schmidt-Schau\ss and Massimo Marchiori and Sven Eric Panitz}, journal={Theor. Comput. Sci.}, year={1995}, volume={149}, pages={361-374} }