On Normalisation of Infinitary Combinatory Reduction Systems
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 needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduct...
Saved in:
Published in | Rewriting Techniques and Applications pp. 172 - 186 |
---|---|
Main Author | |
Format | Book Chapter |
Language | English |
Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
|
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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
needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and thatweak and strong normalisation coincide for such systems as a whole and, in case reductions are non-erasing, also for terms. |
---|---|
ISBN: | 9783540705888 3540705880 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-540-70590-1_12 |