Modularity of Convergence in Infinitary Rewriting

  • Stefan Kahrs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5595)


Properties of Term Rewriting Systems are called modular iff they are preserved under 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 a modular property, lifting a restriction from a known result by Simonsen, and that Convergence is modular for non-collapsing Infinitary Term Rewriting Systems.


Weak Convergence Disjoint Union Strong Convergence Function Symbol Reduction Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of nondeterministic recursive programs. Theoretical Computer Science 11(2), 181–205 (1980)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Dershowitz, N., Kaplan, S.: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite,.. In: Principles of Programming Languages, pp. 250–259. ACM, New York (1989)Google Scholar
  3. 3.
    Hajnal, A., Hamburger, P.: Set Theory. London Mathematical Society (1999)Google Scholar
  4. 4.
    Kahrs, S.: Infinitary rewriting: Meta-theory and convergence. Acta Informatica 44(2), 91–121 (2007)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Kennaway, R.: On transfinite abstract reduction systems. Technical Report CS-R9205, Centrum voor Wiskunde en Informatica, Amsterdam (1992)Google Scholar
  6. 6.
    Kennaway, R., de Vries, F.-J.: Infinitary Rewriting. In: Term Rewriting Systems, pp. 668–711. Cambridge University Press, Cambridge (2003)Google Scholar
  7. 7.
    Ketema, J.: Böhm-Like Trees for Rewriting. PhD thesis, Vrije Universiteit Amsterdam (2006)Google Scholar
  8. 8.
    Potter, M.D.: Sets: An Introduction. Oxford University Press, Oxford (1990)MATHGoogle Scholar
  9. 9.
    Sierpiński, W.: Cardinal and Ordinal Numbers. Polish Scientific Publishers (1965)Google Scholar
  10. 10.
    Simonsen, J.G.: On modularity in infinitary term rewriting. Information and Computation 204(6), 957–988 (2006)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)Google Scholar
  12. 12.
    Toyama, Y.: On the Chuch-Rosser property for the direct sum of term rewriting systems. Journal of the ACM 34(1), 128–143 (1987)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Zantema, H.: Normalisation of infinite terms. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 441–455. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Stefan Kahrs
    • 1
  1. 1.Department of Computer ScienceUniversity of KentCanterburyUK

Personalised recommendations