Modularity of Convergence in Infinitary Rewriting

Kahrs, Stefan (2009) Modularity of Convergence in Infinitary Rewriting. In: Treinen, Ralf, ed. Rewriting Techniques and Applications 20th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 179-193. ISBN 978-3-642-02347-7. E-ISBN 978-3-642-02348-4. (doi:10.1007/978-3-642-02348-4_13) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Abstract

Properties of Term Rewriting Systems are called Modular iff they are preserved tinder 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 no redex position in a reduction sequence is used infinitely often. In this paper it is shown that Strong Convergence is it modular property, lifting a restriction from a known result by Simonsen, and that Convergence is modular for non-collapsing Infinitary Term Rewriting Systems

Item Type:	Book section
DOI/Identification number:	10.1007/978-3-642-02348-4_13
Uncontrolled keywords:	Modularity Convergence
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	29 Mar 2010 12:16 UTC
Last Modified:	29 May 2019 10:23 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/24126 (The current URI for this page, for reference purposes)