Infinitary rewriting: Closure operators, equivalences and models

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Infinitary Term Rewriting allows to express infinite terms and transfinite reductions that converge to those terms. Underpinning the machinery of infinitary rewriting are closure operators on relations that facilitate the formation of transfinite reductions and transfinite equivalence proofs. The literature on infinitary rewriting has largely neglected to single out such closure operators, leaving them implicit in definitions of (transfinite) rewrite reductions, or equivalence relations. This paper unpicks some of those definitions, extracting the underlying closure principles used, as well as constructing alternative operators that lead to alternative notions of reduction and equivalence. A consequence of this unpicking is an insight into the abstraction level at which these operators can be defined. Some of the material in this paper already appeared in Kahrs (2010). The paper also generalises the notion of equational model for infinitary rewriting. This leads to semantics-based notions of equivalence that tie in with the equivalences constructed from the closure operators. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kahrs, S. (2013). Infinitary rewriting: Closure operators, equivalences and models. Acta Informatica, 50(2), 123–156. https://doi.org/10.1007/s00236-012-0174-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free