Termination of context-sensitive rewriting by rewriting

  • Salvador Lucas
Session 2: Fairness, Domination, and the μ-Calculus
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)


Context-sensitive rewriting allows us to deal with certain context-replacing restrictions in performing reduction steps. This is useful in avoiding undesirable reductions. In this paper, we study termination of context-sensitive rewriting. We give some conditions under which it is possible to analyze the termination of the context-sensitive rewrite relation induced by a term rewriting system by means of any method to prove termination of rewriting. This allows us to apply all known (and forthcoming) results on termination to context-sensitive rewriting.


term rewriting functional programming termination 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science 17:279–301, 1982.CrossRefGoogle Scholar
  2. 2.
    N. Dershowitz. Termination of rewriting. Journal on Symbolic Computation, 3:69–115, 1987.Google Scholar
  3. 3.
    N. Dershowitz. A Taste of Rewrite Systems. In P. E. Lauer, editor, Proc. of Functional Programming, Concurrency, Simulation and Automated Reasoning, LNCS 693:199–228, Springer-Verlag, Berlin, 1993.Google Scholar
  4. 4.
    N. Dershowitz and C. Hoot. Natural Termination. Theoretical Computer Science 142(2):179–207, 1995.CrossRefGoogle Scholar
  5. 5.
    N. Dershowitz and J. P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243–320. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990.Google Scholar
  6. 6.
    D.P. Friedman and D.S. Wise. CONS should not evaluate its arguments. In S. Michaelson and R. Milner, editors, Automata, Languages and Programming, pages 257–284, Edinburgh University Press, 1976.Google Scholar
  7. 7.
    J. Goguen, C. Kirchner and J. Meseguer. Concurrent Term Rewriting as a Model of Computation. In J. H. Fasel, R. M. Keller, editors, Graph Reduction. Proceedings. of a Workshop. LNCS 279:53–93. Springer-Verlag, Berlin, 1987.Google Scholar
  8. 8.
    S. Kamin and J.J. Lévy. Two generalizations of the recursive path ordering. University of Illinois, 1980.Google Scholar
  9. 9.
    J. F. Th. Kamperman and H. R. Walters. Lazy Rewriting and Eager Machinery. In J. Hsiang, editor, Proc. of the 6th International Conference on Rewriting Techniques and Applications, RTA'95, LNCS 914:147–162, Springer-Verlag, Berlin, 1995.Google Scholar
  10. 10.
    G. Huet and J. J. Lévy. Computations in orthogonal term rewriting systems. In J. L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of J. Alan Robinson. MIT Press, Cambridge, MA, 1991.Google Scholar
  11. 11.
    R. Lalement. Computation as Logic. Masson-Prentice Hall International, 1993.Google Scholar
  12. 12.
    S. Lucas. Computational properties in context-sensitive rewriting. In M. Alpuente and M.I. Sessa, editors, Proc. of 1995 Joint Conference on Declarative Programming, GULP-PRODE'95, pages 435–446, 1995.Google Scholar
  13. 13.
    S. Lucas. Fundamentals of context-sensitive rewriting. In M. Bartosek, J. Staudek and J. Wiedermann, editors, Proc. of XXII Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'95, LNCS 1012: 405–412, Springer-Verlag, Berlin, 1995.Google Scholar
  14. 14.
    Z. Manna and S Ness. On the termination of Markov algorithms. In Proc. of the Third Hawaii International Conference on System Science, pages 789–792, 1970.Google Scholar
  15. 15.
    S. L. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, London, 1987.Google Scholar
  16. 16.
    C. Reade. Elements of Functional Programming. Addison-Wesley Publishing Company, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Salvador Lucas
    • 1
  1. 1.Departamento de Sistemas Informáticos y ComputaciónUniversidad Politécnica de ValenciaValenciaSpain

Personalised recommendations