Infinitary combinatory reduction systems: normalising reduction strategies

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Infinitary combinatory reduction systems : normalising reduction strategies. / Ketema, Jeroen; Simonsen, Jakob Grue.

I: Logical Methods in Computer Science, Bind 6, Nr. 1, 7, 2010.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Ketema, J & Simonsen, JG 2010, 'Infinitary combinatory reduction systems: normalising reduction strategies', Logical Methods in Computer Science, bind 6, nr. 1, 7. https://doi.org/10.2168/LMCS-6(1:7)2010

APA

Ketema, J., & Simonsen, J. G. (2010). Infinitary combinatory reduction systems: normalising reduction strategies. Logical Methods in Computer Science, 6(1), [7]. https://doi.org/10.2168/LMCS-6(1:7)2010

Vancouver

Ketema J, Simonsen JG. Infinitary combinatory reduction systems: normalising reduction strategies. Logical Methods in Computer Science. 2010;6(1). 7. https://doi.org/10.2168/LMCS-6(1:7)2010

Author

Ketema, Jeroen ; Simonsen, Jakob Grue. / Infinitary combinatory reduction systems : normalising reduction strategies. I: Logical Methods in Computer Science. 2010 ; Bind 6, Nr. 1.

Bibtex

@article{4fccabe61968491399b3135eebeb4c39,
title = "Infinitary combinatory reduction systems: normalising reduction strategies",
abstract = "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. ",
author = "Jeroen Ketema and Simonsen, {Jakob Grue}",
year = "2010",
doi = "10.2168/LMCS-6(1:7)2010",
language = "English",
volume = "6",
journal = "Logical Methods in Computer Science",
issn = "1860-5974",
publisher = "International Federation for Computational Logic",
number = "1",

}

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