Paper Info
Title
Discrete Normalization and Standardization in Deterministic Residual Structures
Abstract
Abstract Reduction Systems with axiomatized notions of , which model orthogonal rewrite systems. The latter theorem gives a strategy for construction of reductions L evy-equivalent (or permutation-equivalent) to a given, nite or innite, (or ) reduction, based on the 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.
Year
DOI
Venue
1996
10.1007/3-540-61735-3_9
ALP
Keywords
Field
DocType
deterministic residual structures,discrete normalization,functional language
Residual,Lambda calculus,Normalization (statistics),Functional programming,Algebra,Normalisation by evaluation,Computer science,Denotational semantics,Theoretical computer science,Standardization
Conference
ISBN
Citations 
PageRank 
3-540-61735-3
8
0.52
References 
Authors
25
2
Name
Order
Citations
PageRank
Zurab Khasidashvili130725.40
John R. W. Glauert214512.14