Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems

  • Alberto Pettorossi
Session 14: C. P. Schnorr, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


We give a sufficient condition for proving strong termination in Combinatory Logic and Rewriting Systems which solves an open problem [Böh 77]. We also compare, in the context of general rewriting systems, the power of that condition and other known methods, as the recursive path orderings and simplification orderings, presenting original results.

A new technique for proving strong termination, called Diagram of Matchings, is also introduced. In many cases it allows to combine together the strength of various methods of proof.


Strong Termination Combinatory Logic Axiom Schema Rewrite System Basic Combinator 
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.

8. References

  1. [Böh 77]
    Böhm,C. Private communication: "All applicative combinations of + have strong normal form" (1977).Google Scholar
  2. [Cur 58]
    Curry, H.B. and R. Feys: Combinatory Logic Vol. I. North-Holland Publishing Company, Amsterdam (1958).Google Scholar
  3. [Der 79a]
    Dershowitz,N. and Z.Manna: "Proving termination with multiset with multiset orderings" C.A.C.M. Vol. 22 N. 8, 465–476.Google Scholar
  4. [Der 79b]
    Dershowitz,N.: "A note on simplification orderings" Info. Proc. Lett. Vol. 9, N. 5, 212–215.Google Scholar
  5. [Der 79c]
    Dershowitz,N.: "Orderings for Term Rewriting Systems" 20th Foundations of Computer Science Symposium (1979).Google Scholar
  6. [Hue 77]
    Huet,G.: "Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems", 18th IEEE Symposium on Foundations of Computer Science (1977) 30–45.Google Scholar
  7. [HuO 80]
    Huet, G. and D. Oppen: "Equations and rewrite rules: a survey", Technical Report CSL-111 (Jan. 80) SRI International, Menlo Park, California, U.S.A.Google Scholar
  8. [KaL 80]
    Kamin,S. and J.J.Lévy: "Attempts for generalizing the Recursive Path Orderings" (unpublished manuscript 1980).Google Scholar
  9. [Lév 80]
    Lévy,J.J. Personal communication (1980).Google Scholar
  10. [Pet 75]
    Pettorossi,A.: "On termination of subrecursive classes of algorithms" (in Italian), AICA Congress 1975, Genova (Italy).Google Scholar
  11. [Pet 78]
    Pettorossi,A.: "A Property which guarantees termination in Weak Combinatory Logic and Subtree Replacement Systems". Rapporto Istituto di Automatica, University of Rome (Italy) (1978).Google Scholar
  12. [Pla 78]
    Plaisted, D.: "A recursively defined ordering for proving termination of term rewriting systems", Report R-78-943, Dept. of Computer Science, University of Illinois, Urbana, Ill. (1978).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Alberto Pettorossi
    • 1
    • 2
  1. 1.IASI-CNRRomaItaly
  2. 2.Computer Science DepartmentEdinburgh UniversityEdinburghScotland

Personalised recommendations