Computing with Infinite Terms and Infinite Reductions
Research output: Contribution to journal › Journal article › Research › peer-review
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.
Original language | English |
---|---|
Journal | Fundamenta Informaticae |
Volume | 170 |
Issue number | 4 |
Pages (from-to) | 339-365 |
Number of pages | 27 |
ISSN | 0169-2968 |
DOIs | |
Publication status | Published - 2019 |
- computability, descendants, Infinitary term rewriting, needed reductions, origins
Research areas
ID: 237848147