Transformation ordering

  • F. Bellegarde
  • P. Lescanne
Session CAAP 2 Proving Techniques
Part of the Lecture Notes in Computer Science book series (LNCS, volume 249)


We define an ordering called transformation ordering which is useful for proving termination of rewriting systems. A transformation ordering is defined using two relations: a relation which transforms terms and a relation which ensures the well-foundedness of the ordering. A property between these two relations called cooperation is required. Cooperation is similar to confluence and thus may be localized. Therefore, if relations are rewrite relations, it is possible to decide the cooperation by looking at critical pairs. Transformation orderings prove termination of rewriting systems that cannot be proved by the classical methods.


  1. 1.
    L. Bachmair and N. Dershowitz, "Commutation, Transformation, and Termination," in Proc. 8th Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 230, Springer Verlag, Oxford (England), 1986.Google Scholar
  2. 2.
    L. Bachmair and D. Plaisted, "Associative Path Orderings," in tProc. 1st Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 241–254, Springer Verlag, Dijon (France), 1985.Google Scholar
  3. 3.
    J. Backus, "Can Programming Be Liberated From the Von Neumann Style? A Functional Style And Its Algebra of Programs," Comm. of ACM, vol. 21, no. 8, pp. 613–641, 1978.CrossRefGoogle Scholar
  4. 4.
    F. Bellegarde, "Utilisation des Systèmes de Réécriture d'Expressions Fonctionnelles comme outiles de Transformation de Programmes Itératifs," Thèse de doctorat d'Etat, Université de Nancy I, Dept. Mathématiques Appliquées, 1985.Google Scholar
  5. 5.
    F. Bellegarde, "Rewriting Systems on FP Expressions to reduce the number of Sequences Yielded." Science of Computer Programming, vol. 6. pp. 11–34, North-Holland, 1986.CrossRefGoogle Scholar
  6. 6.
    F. Bellegarde and P. Lescanne, "Termination Proofs Based On Transformation Techniques," Submitted To Information and Control, 1986.Google Scholar
  7. 7.
    N. Dershowitz, "Termination," in Proc. 1rst Conf. Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 202, pp. 180–224, Springer Verlag, Dijon (France), May 1985.Google Scholar
  8. 7.
    I. Gnaedig and P. Lescanne, "Proving Termination of Associative Commutative Rewriting Systems by Rewriting," Proceedings 8th International Conference on Automated Deduction, Oxford (England), 27–31 July 1986.Google Scholar
  9. 9.
    G. Huet and D. Oppen, "Equations and Rewrite Rules: A Survey," in Formal Languages: Perspectives And Open Problems, ed. Book R., Academic Press, 1980.Google Scholar
  10. 10.
    S. Kamin and J.J. Levy, "Attempts for Generalizing the Recursive Path Ordering," Inria, Rocquencourt, 1982, University of Illinois Report.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • F. Bellegarde
    • 1
  • P. Lescanne
    • 1
  1. 1.Crin Centre De Recherche En Informatique De NancyVandoeuvre les Nancy CedexFrance

Personalised recommendations