Paper Info
Title
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
Abstract
. We design a strategy that for any given term t in an OrthogonalTerm Rewriting System (OTRS) constructs a longest reductionstarting from t if t is strongly normalizable, and constructs an infinitereduction otherwise. For some classes of OTRSs the strategy is easilycomputable. We develop a method for finding the least upper bound oflengths of reductions starting from a strongly normalizable term. We givealso some applications of our results.1 IntroductionIt is shown in O'Donnell [12]...
Year
DOI
Venue
1994
10.1007/3-540-57785-8_139
STACS
Keywords
Field
DocType
strong normalization,orthogonal term rewriting systems,upper bound
Discrete mathematics,Normalization (statistics),Combinatory logic,Infimum and supremum,Rewriting,Normalization property,Mathematics
Conference
ISBN
Citations 
PageRank 
3-540-57785-8
11
0.79
References 
Authors
5
1
Name
Order
Citations
PageRank
Zurab Khasidashvili130725.40