TY - JOUR
T1 - Natural termination
AU - Dershowitz, Nachum
AU - Hoot, Charles
N1 - Funding Information:
~This research was supported in part by the US National Science Foundation under Grants CCR-90-07195 and CCR-90-24271. The first author was also supported by a Lady Davis fellowship at the Hebrew University of Jerusalem and a Meyerhoff fellowship at the Weizmann Institute of Science. This is a revised and expanded version of Topics in Termination E8\]. * Corresponding author. E-mail: nachum@cs.uiuc.edu.
PY - 1995/5/15
Y1 - 1995/5/15
N2 - Two techniques are examined for showing termination of rewrite systems when simplification orderings are insufficient. The first approach generalizes the various path orderings and the conditions under which they work. Examples of its use are given and a brief description of an implementation is presented. The second approach uses restricted derivations, called "forward closures", for proving termination of orthogonal and overlaying systems. Both approaches allow the use of "natural" interpretations under which rules rewrite terms to terms of the same value.
AB - Two techniques are examined for showing termination of rewrite systems when simplification orderings are insufficient. The first approach generalizes the various path orderings and the conditions under which they work. Examples of its use are given and a brief description of an implementation is presented. The second approach uses restricted derivations, called "forward closures", for proving termination of orthogonal and overlaying systems. Both approaches allow the use of "natural" interpretations under which rules rewrite terms to terms of the same value.
UR - http://www.scopus.com/inward/record.url?scp=0000356971&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(94)00275-4
DO - 10.1016/0304-3975(94)00275-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0000356971
SN - 0304-3975
VL - 142
SP - 179
EP - 207
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 2
ER -