Infinitary combinatory reduction systems: normalising reduction strategies
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Infinitary combinatory reduction systems : normalising reduction strategies. / Ketema, Jeroen; Simonsen, Jakob Grue.
In: Logical Methods in Computer Science, Vol. 6, No. 1, 7, 2010.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Infinitary combinatory reduction systems
T2 - normalising reduction strategies
AU - Ketema, Jeroen
AU - Simonsen, Jakob Grue
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
U2 - 10.2168/LMCS-6(1:7)2010
DO - 10.2168/LMCS-6(1:7)2010
M3 - Journal article
VL - 6
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
SN - 1860-5974
IS - 1
M1 - 7
ER -
ID: 32193273