Title :
Strong sequentiality of left-linear overlapping term rewriting systems
Author_Institution :
NTT Labs., Kyoto
Abstract :
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
Keywords :
rewriting systems; critical pair; index reduction; left-linear overlapping term rewriting systems; root balanced reductions; sequentiality; weakly orthogonal left-normal systems; Calculus; Functional programming; Laboratories; Logic; Petroleum; Tellurium; Utility programs; Writing;
Conference_Titel :
Logic in Computer Science, 1992. LICS '92., Proceedings of the Seventh Annual IEEE Symposium on
Conference_Location :
Santa Cruz, CA
Print_ISBN :
0-8186-2735-2
DOI :
10.1109/LICS.1992.185540