Abstract
We investigate the notion of `infinitary strong normalization' (SN *** ), introduced in [6], the analogue of termination when rewriting infinite terms. A (possibly infinite) term is SN *** if along every rewrite sequence each fixed position is rewritten only finitely often. In [9], SN *** has been investigated as a system-wide property, i.e. SN *** for all terms of a given rewrite system. This global property frequently fails for trivial reasons. For example, in the presence of the collapsing rule tail(x:*** )****** , the infinite term t =tail(0:t) rewrites to itself only. Moreover, in practice one usually is interested in SN *** of a certain set of initial terms. We give a complete characterization of this (more general) `local version' of SN *** using interpretations into weakly monotone algebras (as employed in [9]). Actually, we strengthen this notion to continuous weakly monotone algebras (somewhat akin to [5]). We show that tree automata can be used as an automatable instance of our framework; an actual implementation is made available along with this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
