Computer Science – Logic in Computer Science
Scientific paper
2010-06-15
LMCS 6 (3:18) 2010
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-6(3:18)2010
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 \infty.
No associations
LandOfFree
Modularity of Convergence and Strong Convergence in Infinitary Rewriting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modularity of Convergence and Strong Convergence in Infinitary Rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modularity of Convergence and Strong Convergence in Infinitary Rewriting will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-104757