Termination of order-sorted rewriting

  • Isabelle Gnaedig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 632)


In this paper, the problem of termination of rewriting in order-sorted algebras is addressed for the first time. Our goal is to perform termination proofs of programs for executable specification languages like OBJ3. An extension of Lexicographic Path Ordering is proposed, that gives a termination proof for order-sorted rewrite systems, that would not terminate in the unsorted case. We mention also, that this extension provides a termination tool for unsorted terminating systems, that usual orderings cannot handle.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Bernot, M. Bidoit, and C. Choppy. Abstract data types with exception handling: an initial approach based on a distinction between exceptions and errors. Theoretical Computer Science, 46:13–45, 1986.Google Scholar
  2. [2]
    N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279–301, 1982.Google Scholar
  3. [3]
    N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 & 2):69–116,1987.Google Scholar
  4. [4]
    I. Gnaedig. Termination of rewriting in order-sorted algebras. Technical Report 91-R-108, Centre de Recherche en Informatique de Nancy, 1991.Google Scholar
  5. [5]
    I. Gnaedig. ELIOS-OBJ: Theorem proving in a specification language. In B. Krieg-Brückner, editor, Proceedings of the 4th European Symposium on Programming, pages 182–199. Lecture Notes in Computer Science, February 1992. Volume 582.Google Scholar
  6. [6]
    I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. Theoretical Computer Science, 72:169–202, 1990.Google Scholar
  7. [7]
    J. A. Goguen and J. Meseguer. Order-sorted algebra I: Partial and overloaded operations, errors and inheritance. Technical report, SRI International, Computer Science Lab, 1988. Given as lecture at a Seminar on Types, Carnegie-Mellon University, June 1983.Google Scholar
  8. [8]
    J. A. Goguen, J. Meseguer, and D. Plaisted. Programming with parameterized abstract objects in OBJ. Theory And Practice of Software Technology, pages 163–193, 1982.Google Scholar
  9. [9]
    John V. Guttag, James J. Horning, and J. M. Wing. Larch in five easy pieces. Technical report, Digital Systems Research Center, 1985.Google Scholar
  10. [10]
    J. Roger Hindley and Johnathan P. Seldin. Introduction to Combinators and Lambdacalculus. Cambridge University, 1986.Google Scholar
  11. [11]
    G. Huet and D. Oppen. Equations and rewrite rules: A survey. In R. V. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349–405. Academic Press, New York, 1980.Google Scholar
  12. [12]
    S. Kamin and J.-J. Lévy. Attempts for generalizing the recursive path ordering. Inria, Rocquencourt, 1982.Google Scholar
  13. [13]
    C. Kirchner, H. Kirchner, and J. Meseguer. Operational semantics of OBJ-3. In Proceedings of 15th International Colloquium on Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, pages 287–301. Springer-Verlag, 1988.Google Scholar
  14. [14]
    G. Smolka. Tel (version 0.9), report and user manual. SEKI report SR-87-11, Universität Kaiserslautern (Germany), 1988.Google Scholar
  15. [15]
    Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the Association for Computing Machinery, 34(1):128–143, January 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Isabelle Gnaedig
    • 1
  1. 1.Technopôle de Nancy-BraboisINRIA Lorraine-CRIN CNRSVillers-lès-NancyFrance

Personalised recommendations