Persistence of Termination for Right-Linear Overlay Term Rewriting Systems.
Munehiro Iwami · 2005
Abstract — A property is called persistent if for any manysorted term rewriting system, has the property if and only if term rewriting system, which results from by omitting its sort information, has the property. In this paper, we show that termination is persistent for right-linear overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that termination is modular for right-linear overlay term rewriting systems.