Skip to main content
SpringerLink
Log in

Rewrite orderings and termination of rewrite systems

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 520))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.A. Cichon. Bounds on derivation lenghts from termination proofs. Technical Report CSD-TR-622, Royal Holloway and Bedford New College, 1990.

    Google Scholar 

  2. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137–160, October 1987.

    Google Scholar 

  3. A. Cichon and P. Lescanne. Strict polynomial interpretation works only for termination of polynomial growth functions. in preparation, 1991.

    Google Scholar 

  4. G. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings 2nd GI Conference on Automata and Formal Languages, Lecture Notes in Computer Science. Springer-Verlag, 1975.

    Google Scholar 

  5. M. Dauchet. Simulation of Turing machines by a left-linear rewrite rule. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill, (North Carolina, USA), volume 355 of Lecture Notes in Computer Science, pages 109–120. Springer-Verlag, April 1989.

    Google Scholar 

  6. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 & 2):69–116, 1987.

    Google Scholar 

  7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Van Leuven, editor, Handbook of Theoretical Computer Science. North-Holland, 1990.

    Google Scholar 

  8. N. Dershowitz, J.-P. Jouannaud, and J.W. Klop. Open problems in rewriting. In R.V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como, (Italy), volume 488 of Lecture Notes in Computer Science, pages 445–456. Springer-Verlag, April 1991.

    Google Scholar 

  9. F. Drewes and C. Lauterman. Incremental termination proofs and the length of derivations. In R.V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como, (Italy), volume 488 of Lecture Notes in Computer Science, pages 49–61. Springer-Verlag, April 1991.

    Google Scholar 

  10. N. Dershowitz and M. Okada. Proof-theoretic techniques and the theory of rewriting. In Proceedings 3rd IEEE Symposium on Logic in Computer Science, Edinburgh (UK), pages 104–11. IEEE, 1988.

    Google Scholar 

  11. O. Geupel. Terminationbeweise bei termersetzungssytem, 1988. Diplomarbeit.

    Google Scholar 

  12. I. Gnaedig. Termination of rewriting in order-sorted algebras. draft, April 1991.

    Google Scholar 

  13. G. Higman. Ordering by divisibility in abstract algebra. Proc. London Math. Soc., 3(2):326–336, 1952.

    Google Scholar 

  14. G. Huet and D.S. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, Laboria, France, 1978.

    Google Scholar 

  15. D. Hofbauer and C. Lautemann. Termination proofs and the length of derivations. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill, (North Carolina, USA), volume 355 of Lecture Notes in Computer Science, pages 167–177. Springer-Verlag, April 1989.

    Google Scholar 

  16. D. Hofbauer. Termination proofs by multiset path orderings imply primitive recursive derivation lenghts. In H. Kirchner and W. Wechler, editors, Proc. 2nd Int. workshop on Algebraic and Logic Programming, volume 463 of Lecture Notes in Computer Science, pages 347–358, 1990.

    Google Scholar 

  17. J.-P. Jouannaud, P. Lescanne, and F. Reinig. Recursive decomposition ordering. In Bjørner D., editor, Formal Description of Programming Concepts 2, pages 331–348, Garmisch-Partenkirchen, Germany, 1982. North-Holland.

    Google Scholar 

  18. J.B. Kruskal. Well-quasi ordering, the tree theorem and Vazsonyi's conjecture. Trans. Amer. Math. Soc., 95:210–225, 1960.

    Google Scholar 

  19. D.S. Lankford. On proving term rewriting systems are noetherian. Technical report, Louisiana Tech. University, Mathematics Dept., Ruston LA, 1979.

    Google Scholar 

  20. P. Lescanne. Divergence of the Knuth-Bendix completion procedure and termination orderings. Bulletin of European Association for Theoretical Computer Science, 30:80–83, October 1986.

    Google Scholar 

  21. P. Lescanne. Well rewrite orderings. In J. Mitchell, editor, 5th Symp. Logic in Computer Science, pages 239–256. IEEE, 1990.

    Google Scholar 

  22. F. L. Morris and C. B. Jones. An early program proof by Alan Turing. Annals of the History of Computing, 6(2):139–143, April 1984.

    Google Scholar 

  23. M.H.A. Newman. On theories with a combinatorial definition of equivalence. In Annals of Math, volume 43, pages 223–243, 1942.

    Google Scholar 

  24. P. Narendran and M. Rusinowitch. Any ground associative-commutative theory has a finite canonical system. In R.V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como, (Italy), volume 488 of Lecture Notes in Computer Science, pages 423–434. Springer-Verlag, April 1991.

    Google Scholar 

  25. M.J. O'Donnell. Equational Logic as a Programming Language. Foundation of Computing. MIT Press, 1985.

    Google Scholar 

  26. L. Puel. Embedding with patterns and associated recursive path ordering. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill, (North Carolina, USA), volume 355 of Lecture Notes in Computer Science, pages 371–387. Springer-Verlag, April 1989.

    Google Scholar 

  27. L. Puel. Using unavoidable set of trees to generalize Kruskal's theorem. Journal of Symbolic Computation, 8:335–382, 1989.

    Google Scholar 

  28. Jocelyne Rouyer. Calcul formel en géométrie algébrique réelle appliqué à la terminaison des systèmes de réécriture. PhD thesis, Université de Nancy 1, 1991.

    Google Scholar 

  29. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, second edition, 1951.

    Google Scholar 

  30. A.M. Turing. Checking a large routine. In Report of a Conference on High Speed Automatic Calculing Machines, pages 67–69, Cambridge, 1949. Univ. Math. Lab.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de Recherche en Informatique de Nancy (CNRS) and Inria-Lorraine Domaine Scientifique Victor Grignard, BP 239, 54506, Vandœuvre-lès-Nancy, France

    Pierre Lescanne

Authors
  1. Pierre Lescanne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lescanne, P. (1991). Rewrite orderings and termination of rewrite systems. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation