Computing with Infinite Terms and Infinite Reductions
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Fundamenta Informaticae |
Vol/bind | 170 |
Udgave nummer | 4 |
Sider (fra-til) | 339-365 |
Antal sider | 27 |
ISSN | 0169-2968 |
DOI | |
Status | Udgivet - 2019 |
ID: 237848147