A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Modular termination of r-consistent and left-linear term rewriting systems
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
doi:10.1016/0304-3975(95)00080-g
fatcat:3a66qxq4jbao5jddrjxj3xyhre