## Discrete Normalization and Standardization in Deterministic Residual Structures (1996)

Venue: | In ALP '96 [ALP96 |

Citations: | 10 - 3 self |

### BibTeX

@INPROCEEDINGS{Khasidashvili96discretenormalization,

author = {Zurab Khasidashvili and John Glauert},

title = {Discrete Normalization and Standardization in Deterministic Residual Structures},

booktitle = {In ALP '96 [ALP96},

year = {1996},

pages = {135--149}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We prove a version of the Standardization Theorem and the Discrete Normalization (DN) Theorem in stable Deterministic Residual Structures, which are Abstract Reduction Systems with axiomatized residual relation, and model orthogonal rewrite systems. The latter theorem gives a strategy for construction of reductions L'evy-equivalent (or permutation-equivalent) to a given, finite or infinite, regular (or semi-linear) reduction, based on the neededness concept of Huet and L'evy. This and other results of this paper add to the understanding of L'evy-equivalence of reductions, and consequently, L'evy's reduction space. We demonstrate how elements of this space can be used to give denotational semantics to known functional languages in an abstract manner. 1 Introduction Long ago, Curry and Feys [CuFe58] proved that repeated contraction of leftmostoutermost redexes in any normalizable -term eventually yields its normal form, even if the term possesses infinite reductions as well. The reaso...