### 抜粋

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.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Proceedings - Symposium on Logic in Computer Science |

出版者 | Publ by IEEE |

ページ | 274-284 |

ページ数 | 11 |

ISBN（印刷物） | 0818627352 |

出版物ステータス | Published - 1992 6 1 |

イベント | Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science - Santa Cruz, CA, USA 継続期間: 1992 6 22 → 1992 6 25 |

### 出版物シリーズ

名前 | Proceedings - Symposium on Logic in Computer Science |
---|

### Other

Other | Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science |
---|---|

市 | Santa Cruz, CA, USA |

期間 | 92/6/22 → 92/6/25 |

### ASJC Scopus subject areas

- Software
- Mathematics(all)

## フィンガープリント Strong sequentiality of left-linear overlapping term rewriting systems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

Toyama, Y. (1992). Strong sequentiality of left-linear overlapping term rewriting systems. ：

*Proceedings - Symposium on Logic in Computer Science*(pp. 274-284). (Proceedings - Symposium on Logic in Computer Science). Publ by IEEE.