## Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems

### Cached

### Download Links

- [www.cs.bgu.ac.il]
- [www.phil.uu.nl]
- [www.brl.ntt.co.jp]
- [www.brl.ntt.co.jp]
- [www.cs.bgu.ac.il]
- [www.brl.ntt.co.jp]
- DBLP

### Other Repositories/Bibliography

Venue: | INFORMATION AND COMPUTATION |

Citations: | 7 - 2 self |

### BibTeX

@ARTICLE{Khasidashvili_perpetualityand,

author = {Zurab Khasidashvili and Mizuhito Ogawa and Vincent van Oostrom},

title = {Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems},

journal = {INFORMATION AND COMPUTATION},

year = {},

volume = {164},

pages = {118--151}

}

### OpenURL

### Abstract

We present two characterizations of perpetual redexes, which are redexes whose contractions retain the possibility of infinite reductions. These characterizations generalize and strengthen existing criteria for the perpetuality of redexes in orthogonal Term Rewriting Systems and the -calculus due to Bergstra and Klop, and others. To unify our results with those in the literature, we introduce Context-sensitive Conditional Expression Reduction Systems (CCERSs) and prove confluence for orthogonal CCERSs. We then define a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's permutation ordering on reductions) infinite reductions in orthogonal CCERSs. We then prove (1) perpetuality (in a specific context) of a redex whose contraction does not erase potentially infinite arguments, which are possibly finite (i.e., strongly normalizable) arguments that may become infinite after a number of outside steps, and (2) perpetuality (in every con...