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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - Symposium on Logic in Computer Science |
| Publisher | Publ by IEEE |
| Pages | 274-284 |
| Number of pages | 11 |
| ISBN (Print) | 0818627352 |
| Publication status | Published - 1992 Jun 1 |
| Event | Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science - Santa Cruz, CA, USA Duration: 1992 Jun 22 → 1992 Jun 25 |
Publication series
| Name | Proceedings - Symposium on Logic in Computer Science |
|---|
Other
| Other | Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science |
|---|---|
| City | Santa Cruz, CA, USA |
| Period | 92/6/22 → 92/6/25 |
ASJC Scopus subject areas
- Software
- Mathematics(all)
Fingerprint Dive into the research topics of 'Strong sequentiality of left-linear overlapping term rewriting systems'. Together they form a unique fingerprint.
Cite this
Toyama, Y. (1992). Strong sequentiality of left-linear overlapping term rewriting systems. In Proceedings - Symposium on Logic in Computer Science (pp. 274-284). (Proceedings - Symposium on Logic in Computer Science). Publ by IEEE.