Perpetuality and strong normalization in orthogonal term rewriting systems (1994) [11 citations — 6 self]
Download:
|
|
by Zurab Khasidashvili
In: Proc. of 11 th Symposium on Theoretical Aspects of Computer Science, STACS'94
http://www.sys.uea.ac.uk/~zurab/conferences/stacs-94.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Khasidashvili94perpetualityand,author = {Zurab Khasidashvili},
title = {Perpetuality and strong normalization in orthogonal term rewriting systems},
booktitle = {In: Proc. of 11 th Symposium on Theoretical Aspects of Computer Science, STACS'94},
year = {1994},
pages = {163--174},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
Abstract. We design a strategy that for any given term t in an Orthogonal Term Rewriting System (OTRS) constructs a longest reduction starting from t if t is strongly normalizable, and constructs an infinite reduction otherwise. For some classes of OTRSs the strategy is easily computable. We develop a method for finding the least upper bound of lengths of reductions starting from a strongly normalizable term. We give also some applications of our results. 1
