Paper Info
Title
Optimal Normalization in Orthogonal Term Rewriting Systems
Abstract
. We design a normalizing strategy for orthogonal term rewritingsystems (OTRSs), which is a generalization of the call-by-need strategyof Huet-L'evy [4]. The redexes contracted in our strategy are essentialin the sense that they have "descendants" under any reduction of a giventerm. There is an essential redex in any term not in normal form. Wefurther show that contraction of the innermost essential redexes gives anoptimal reduction to normal form, if it exists. We classify OTRSs...
Year
DOI
Venue
1993
10.1007/3-540-56868-9_19
RTA
Keywords
Field
DocType
orthogonal term rewriting systems,optimal normalization,normal form
Discrete mathematics,Normalization (statistics),Algebra,Computer science,Algorithm,Decidability,Confluence,Rewriting,Normalization property
Conference
ISBN
Citations 
PageRank 
3-540-56868-9
19
1.05
References 
Authors
5
1
Name
Order
Citations
PageRank
Zurab Khasidashvili130725.40