Term rewriting systems with priorities

  • J. C. M. Baeten
  • J. A. Bergstra
  • J. W. Klop
Families Of Rewriting Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 256)


Term rewriting systems with rules of different priority are introduced. The semantics are explained in detail and several examples are discussed. Note: Partial support received from the European Communities under Esprit contract no. 432, Meteor (An integrated formal approach to industrial software development).


Critical Pair Conditional Equation Algebraic Specification Initial Algebra Term Rewrite System 
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.


  1. [1]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Priority rewrite systems, Report CS-R8407, Centre for Mathematics and Computer Science, Amsterdam 1984.Google Scholar
  2. [2]
    J.A. Bergstra & J.W. Klop, Conditional rewrite rules: confluency and termination, JCSS 32, pp. 323–362, 1986.Google Scholar
  3. [3]
    J.A.Bergstra & J.W.Klop, Algebraic specifications for parametrized data types with minimal parameter and target algebras, Proc. ICALP 1982, Springer LNCS 140, 1982.Google Scholar
  4. [4]
    J.A. Bergstra & J.W. Klop, Initial algebra specifications for parametrized data types, EIK 19, pp. 17–31, 1983.Google Scholar
  5. [5]
    H.Ehrig & B.Mahr, Fundamentals of algebraic specification 1, Springer EATCS Monographs on Theor. Comp. Sci., Springer-Verlag 1985.Google Scholar
  6. [6]
    J.A. Goguen, J.W. Thatcher & E.G. Wagner, An initial algebra approach to the specification, correctness and implementation of abstract datatypes, Current trends in Progr. Meth. IV, Data structuring (R.T. Yeh, ed.), Prentice Hall, New Jersey, 1978.Google Scholar
  7. [7]
    J.A.Goguen, J.W.Thatcher & J.B.Wright, Abstract datatypes as initial algebras and correctness of datatype representations, Proc. ACM Conf. on Comp. Graphics, Pattern Recognition and Data Structure, ACM, New York 1975.Google Scholar
  8. [8]
    G.Huet & D.C.Oppen, Equations and rewrite rules, a survey, Formal Lang., Perspectives and Open Problems, Academic Press, 1980.Google Scholar
  9. [9]
    S. Kaplan, Conditional rewrite rules, Theor. Comp. Sci. 33 (2/3), pp. 175–193, 1984.Google Scholar
  10. [10]
    H.A.Klaeren, Algebraische Spezification, eine Einführung, Springer Lehrbuchreihe Informatik, 1983.Google Scholar
  11. [11]
    J.W.Klop, Combinatory reduction systems, Math. Centre Tract 127, Amsterdam 1980.Google Scholar
  12. [12]
    J.W.Klop, Term rewriting systems, Notes for Seminar on Reduction Machines, Ustica 1985, to appear.Google Scholar
  13. [13]
    B.Kutzler & F.Lichtenberger, Bibliography on abstract datatypes, Informatische Fachberichte 68, Springer 1983.Google Scholar
  14. [14]
    M.J.O'Donnell, Computing in systems described by equations, Springer LNCS 58, 1977.Google Scholar
  15. [15]
    M.J.O'Donnell, Equational logic as a programming language, MIT Press, 1985.Google Scholar
  16. [16]
    U.Pletat, G.Engels & H.D.Ehrich, Operational semantics of algebraic specifications with conditional equations, Forschungsbericht 118/81, Abteilung Informatik, Univ. Dortmund, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • J. C. M. Baeten
    • 1
  • J. A. Bergstra
    • 1
    • 2
  • J. W. Klop
    • 3
    • 4
  1. 1.Department of Computer ScienceUniversity of AmsterdamThe Netherlands
  2. 2.Department of PhilosophyState University of UtrechtThe Netherlands
  3. 3.Centre for Mathematics and Computer ScienceAmsterdam
  4. 4.Department of Computer ScienceFree UniversityAmsterdam

Personalised recommendations