1991-04-10
Transfinite reductions in orthogonal term rewriting systems
Publication
Publication
Strongly convergent reduction is the fundamental notion of reduction in infinitary orthogonal term rewriting systems (OTRSs). For these we prove the Transfinite Parallel Moves Lemma and the Compressing Lemma. Strongness is necessary as shown by counterexamples. Normal forms, which we allow to be infinite, are unique, in contrast to ω-normal forms. Strongly converging fair reductions result in normal forms. In general OTRSs the infinite Church-Rosser Property fails for strongly converging reductions. However for Böhm reduction (as in Lambda Calculus, subterms without head normal forms may be replaced by ⊥) the infinite Church-Rosser property does hold. The infinite Church-Rosser Property for non-unifiable OTRSs follows. The top-terminating OTRSs of Dershowitz c.s. are examples of non-unifiable OTRSs.
| Additional Metadata | |
|---|---|
| , , , , , , , | |
| Springer | |
| doi.org/10.1007/3-540-53904-2_81 | |
| International Conference on Rewriting Techniques and Applications | |
| Organisation | Specification and Analysis of Embedded Systems |
|
Kennaway, R., Klop, J. W., Sleep, R., & de Vries, F.-J. (1991). Transfinite reductions in orthogonal term rewriting systems. In Lecture Notes in Computer Science (pp. 1–12). Springer. doi:10.1007/3-540-53904-2_81 |
|
