TY - GEN
T1 - Strong sequentiality of left-linear overlapping term rewriting systems
AU - Toyama, Yoshihito
PY - 1992/6/1
Y1 - 1992/6/1
N2 - G. Huet and J. J. Levy (INRIA Rep. 359, 1979) showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, index reduction strategy is normalizing. Their result is extended to overlapping term rewriting systems. It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for which a leftmost-outermost reduction strategy is normalizing.
AB - G. Huet and J. J. Levy (INRIA Rep. 359, 1979) showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, index reduction strategy is normalizing. Their result is extended to overlapping term rewriting systems. It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for which a leftmost-outermost reduction strategy is normalizing.
UR - http://www.scopus.com/inward/record.url?scp=0026882533&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026882533&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026882533
SN - 0818627352
T3 - Proceedings - Symposium on Logic in Computer Science
SP - 274
EP - 284
BT - Proceedings - Symposium on Logic in Computer Science
PB - Publ by IEEE
T2 - Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science
Y2 - 22 June 1992 through 25 June 1992
ER -