Infinitary combinatory reduction systems: normalising reduction strategies
Research output: Contribution to journal › Journal article › Research › peer-review
Documents
- Ketema_2010_Infinitary_combinatory
Final published version, 380 KB, PDF document
We study normalising reduction strategies for infinitary Combinatory Reduc-
tion Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary -calculus.
tion Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary -calculus.
| Original language | English |
|---|---|
| Article number | 7 |
| Journal | Logical Methods in Computer Science |
| Volume | 6 |
| Issue number | 1 |
| Number of pages | 35 |
| ISSN | 1860-5974 |
| DOIs | |
| Publication status | Published - 2010 |
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 32193273