Advertisement

Termination of linear rewriting systems

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

Abstract

Limitations, such as right-linearity, on the form of rules in a term-rewriting system are shown to restrict the class of derivations that must be considered when determining whether or not the system terminates for all inputs. These restricted derivations, termed "chains", are obtained by attempting to apply rules to the final terms of derivations that issue from the left-hand side of rules. Similar limitations are shown to guarantee that combining two terminating systems yields a terminating system.

Keywords

Infinite Chain Open Term Rule Application Finite Chain Initial Term 
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.

References

  1. Dershowitz, N. [1979], A note on simplification orderings, Information Processing Letters, vol. 9, no. 5, pp. 212–215.Google Scholar
  2. Dershowitz, N. and Manna, Z. [Aug. 1979], Proving termination with multiset orderings, CACM, vol. 22, no. 8, pp. 465–476.Google Scholar
  3. Huet, G. [Oct. 1980], Confluent reductions: Abstract properties and applications to term rewriting systems, J. ACM, vol. 27, no. 4, pp. 797–821.Google Scholar
  4. Huet, G. and Lankford, D.S. [Mar. 1978], On the uniform halting problem for term rewriting systems, Rapport laboria 283, INRIA, Le Chesnay, France.Google Scholar
  5. Huet, G. and Levy, J.-J. [Aug. 1979], Call by need computations in non-ambiguous linear term rewriting systems, Rapport laboria 359, INRIA, Le Chesnay, France; to appear.Google Scholar
  6. Huet, G. and Oppen, D.C. [1980], Equations and rewrite rules: A survey, in "Formal Languages: Perspectives and Open Problems" (R. Book, ed.), Academic Press, New York.Google Scholar
  7. Knuth, D.E. and Bendix, P.B. [1969], Simple word problems in universal algebras, in "Computational Problems in Universal Algebras" (J. Leech, ed.), Pergamon Press, Oxford, pp. 263–297.Google Scholar
  8. O'Donnell, M. [1977], Computing in systems described by equations, Lecture Notes in Computer Science, vol. 58, Springer Verlag, Berlin.Google Scholar
  9. Rosen, B.K. [1973], Tree-manipulation systems and Church-Rosser theorems, J. ACM, vol. 20, pp. 160–187.Google Scholar
  10. Slagle, J.R. [Oct. 1974], Automated theorem-proving for theories with simplifiers, commutativity, and associativity, J. ACM, vol. 21, no. 4, pp. 622–642.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Nachum Dershowitz
    • 1
  1. 1.Department of Computer ScienceUniversity of IllinoisUrbanaU.S.A.

Personalised recommendations