Computing with Infinite Terms and Infinite Reductions

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Computing with Infinite Terms and Infinite Reductions. / Ketema, Jeroen; Simonsen, Jakob Grue.

In: Fundamenta Informaticae, Vol. 170, No. 4, 2019, p. 339-365.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Ketema, J & Simonsen, JG 2019, 'Computing with Infinite Terms and Infinite Reductions', Fundamenta Informaticae, vol. 170, no. 4, pp. 339-365. https://doi.org/10.3233/FI-2019-1866

APA

Ketema, J., & Simonsen, J. G. (2019). Computing with Infinite Terms and Infinite Reductions. Fundamenta Informaticae, 170(4), 339-365. https://doi.org/10.3233/FI-2019-1866

Vancouver

Ketema J, Simonsen JG. Computing with Infinite Terms and Infinite Reductions. Fundamenta Informaticae. 2019;170(4):339-365. https://doi.org/10.3233/FI-2019-1866

Author

Ketema, Jeroen ; Simonsen, Jakob Grue. / Computing with Infinite Terms and Infinite Reductions. In: Fundamenta Informaticae. 2019 ; Vol. 170, No. 4. pp. 339-365.

Bibtex

@article{bd8b034998f84942a7ffb1b6b6a02d1d,
title = "Computing with Infinite Terms and Infinite Reductions",
abstract = "We define computable infinitary rewriting by introducing computability to the study of strongly convergent infinite reductions over infinite first-order terms. Given computable infinitary reductions, we show that descendants and origins - essential to proving fundamental properties such as compression and confluence - are computable across such reductions.",
keywords = "computability, descendants, Infinitary term rewriting, needed reductions, origins",
author = "Jeroen Ketema and Simonsen, {Jakob Grue}",
year = "2019",
doi = "10.3233/FI-2019-1866",
language = "English",
volume = "170",
pages = "339--365",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "I O S Press",
number = "4",

}

RIS

TY - JOUR

T1 - Computing with Infinite Terms and Infinite Reductions

AU - Ketema, Jeroen

AU - Simonsen, Jakob Grue

PY - 2019

Y1 - 2019

N2 - We define computable infinitary rewriting by introducing computability to the study of strongly convergent infinite reductions over infinite first-order terms. Given computable infinitary reductions, we show that descendants and origins - essential to proving fundamental properties such as compression and confluence - are computable across such reductions.

AB - We define computable infinitary rewriting by introducing computability to the study of strongly convergent infinite reductions over infinite first-order terms. Given computable infinitary reductions, we show that descendants and origins - essential to proving fundamental properties such as compression and confluence - are computable across such reductions.

KW - computability

KW - descendants

KW - Infinitary term rewriting

KW - needed reductions

KW - origins

UR - http://www.scopus.com/inward/record.url?scp=85074375630&partnerID=8YFLogxK

U2 - 10.3233/FI-2019-1866

DO - 10.3233/FI-2019-1866

M3 - Journal article

AN - SCOPUS:85074375630

VL - 170

SP - 339

EP - 365

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 4

ER -

ID: 237848147