School of Computing

Modularity of convergence and strong convergence in infinitary rewriting

Stefan Kahrs

Logical Methods in Computer Science, 6(3):182-196, January 2010 [doi].

Abstract

Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures. Convergence is the property of Infinitary Term Rewriting Systems that all reduction sequences converge to a limit. Strong Convergence requires in addition that redex positions in a reduction sequence move arbitrarily deep.

In this paper it is shown that both Convergence and Strong Convergence are modular properties of non-collapsing Infinitary Term Rewriting Systems, provided (for convergence) that the term metrics are granular. This generalises known modularity results beyond metric (unknown variable d_)\infty$.

Download publication 340 kbytes (PDF)

Bibtex Record

@article{3104,
author = {Stefan Kahrs},
title = {Modularity of Convergence and Strong Convergence in Infinitary Rewriting},
month = {January},
year = {2010},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {10.2168/LMCS-6(3:18)2010},
url = {http://www.cs.kent.ac.uk/pubs/2010/3104},
    publication_type = {article},
    submission_id = {18852_1303132279},
    journal = {Logical Methods in Computer Science},
    volume = {6},
    number = {3},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014