Abstract
For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms with perpetual reductions starting from them do not have (head) normal forms. Using this, we show that 1. needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and that 2. weak and strong normalisation coincide for such systems as a whole and, in case reductions are non-erasing, also for terms. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Ketema, J. (2008). On normalisation of infinitary combinatory reduction systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5117 LNCS, pp. 172–186). https://doi.org/10.1007/978-3-540-70590-1_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
