Full-commutation and fair-termination in equational (and combined) term-rewriting systems

  • Sara Porat
  • Nissim Francez
Term Rewriting Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)


In [PF-85] the concepts of fair derivations and fair-termination in term-rewriting systems were introduced and studied. In this paper, we define the notion of fairness in equational term-rewriting systems, where a derivation step is a composition of the equality generated by a (finite) set of equations with one step rewriting using a set of rules. A natural generalization of E-termination (termination of equational term-rewriting systems), namely E-fair-termination, is presented. We show that fair-termination and E-fair-termination are the same whenever the underlying rewriting relation is E-fully-commuting, a property inspired by Jouannaud and Munoz' E-commutation property. We obtain analogous results for combined term-rewriting systems.


Free Algebra Full Derivation Fair Termination Infinite Chain Derivation Step 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BD-85]
    L. Bachmair, N. Dershowitz: "Commutation, transformation and termination", 1985, (submitted).Google Scholar
  2. [BP-85]
    L. Bachmair, D.A. Plaisted: "Associative path ordering", Proceedings of the First International Conference on Rewriting Techniques and Applications, Dijon, France, May 1985, (LNCS 202, J.P. Jouannaud-ed., Springer, Berlin).Google Scholar
  3. [CS-85]
    G. Costa, C. Stirling: "Weak and strong fairness in CCS", Internal Report, CSR-167-85, University of Edinburgh, Jan. 1985.Google Scholar
  4. [D-82]
    N. Dershowitz: "Orderings for term rewriting systems", J. Theoretical Computer Science, Vol. 17, No. 3, March 1982, pp. 279–301 (previous version appeared in Proceedings of the Symposium on Foundations of Computer Science, San Juan, PR, pp. 123–131, Oct. 1979).CrossRefGoogle Scholar
  5. [GFMdR-81]
    O. Grumberg, N. Francez, J.A. Makowsky, W.P. de Roever: "A proof rule for fair termination of guarded commands", Proceedings of the Int. Symp. on Algorithmic languages, Amsterdam, Oct. 1981, North-Holland.Google Scholar
  6. [JK-84]
    J.P. Jouannaud, H. Kirchner: "Completion of a set of rules modulo a set of equations", 11th Ann. ACM Symp. on Principles of Programming Languages, Salt Lake City, Utah, January 1984, pp. 83–92.Google Scholar
  7. [JM-84]
    J.P. Jouannaud, M. Munoz: "Termination of a set of rules modulo a set of equations", Proceedings of the 7th Intern. Conf. on Automated Deduction, Napa, CA. May 1984, pp. 175–193 (LNCS 170, R.E. Shostak-ed., Springer, Berlin).Google Scholar
  8. [LPS-81]
    D. Lehmann, A. Pnueli, J. Stavi: "Impartiality, justice and fairness: the ethics of concurrent termination", Proceedings 8th ICALP, Acre, Israel, LNCS 115 (O. Kariv, S. Even-eds.), Springer Verlag, 1981.Google Scholar
  9. [P-86]
    S. Porat: "Fairness in models for nondeterministic computations", Ph.D. Thesis, Computer Science Dept., Technion, Haifa, Israel, Jan. 1986.Google Scholar
  10. [PF-85]
    S. Porat, N. Francez: "Fairness in term rewriting systems", Proceedings of the 1st Inter. Conf. on Rewriting Techniques and Applications, Dijon, France, May 1985 (LNCS 202, J.P. Jouannaud-ed., Springer, Berlin).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Sara Porat
    • 1
  • Nissim Francez
    • 1
  1. 1.Computer Science DepartmentTechnion - Israel Institute of TechnologyHaifaIsrael

Personalised recommendations