Skip to main content
SpringerLink
Log in

Fairness in term rewriting systems

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1985)

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

Included in the following conference series:

Abstract

The notion of fair derivation in a term-rewriting system is introduced, whereby every rewrite rule enabled infinitely often along a derivation is infinitely-often applied. A term-rewriting system is fairly-terminating iff all its fair derivations are finite. The paper presents the following question: is it decidable, for an arbitrary ground term rewriting system, whether it fairly terminates or not? A positive answer is given for several subcases. The general case remains open.

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. N. Dershowitz: "Termination of linear rewriting systems", proc. 8th ICALP symp. Acre, Israel, July 1981. In: LNCS 115 (O.Kariv, S.Even — eds.), Springer 1981.

    Google Scholar 

  2. N. Dauchet, S. Tison: "Decidability of confluence for ground term rewriting systems", (undated manuscript), Lille university.

    Google Scholar 

  3. N. Francez: "Fairness", to appear in Texts and monographs in comp. sci., Springer Verlag, 1985.

    Google Scholar 

  4. J. Guttag, D. Kapur, D. R. Musser: "On proving uniform termination and restricted termination of rewriting systems", SIAM J. of Computing, 12, 1, 1983.

    Google Scholar 

  5. D. Harel: "A general result about infinite trees and its applications", proc. 16th ACM-STOC, Washington D.C, May 1984.

    Google Scholar 

  6. G. Huet, D. S. Lankford: "On the uniform halting problem for term rewriting systems", TR 283, INRIA 1978.

    Google Scholar 

  7. D. Lehmann, A. Pnueli, J. Stavi: "Impartiality, justice and fairness: the ethics of concurrent termination", proc. 8th ICALP symp. Acre, Israel, July 1981. In: LNCS 115 (O. Kariv, S. Even — eds.), Springer 1981.

    Google Scholar 

  8. S. Porat, N. Francez: "Fairness in context-free grammars under canonical derivations" proc. STACS, Saarbrucken, January 1985. (Also: TR 340, comp. sci. dept., Technion, 1984).

    Google Scholar 

  9. S. Porat, N. Francez, S. Moran, S. Zaks: "Fair derivation in context-free grammars", Information and Control 55, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept. Technion, Haifa, Israel

    Sara Porat & Nissim Francez

Authors
  1. Sara Porat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nissim Francez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Porat, S., Francez, N. (1985). Fairness in term rewriting systems. In: Jouannaud, JP. (eds) Rewriting Techniques and Applications. RTA 1985. Lecture Notes in Computer Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15976-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-15976-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15976-6

  • Online ISBN: 978-3-540-39679-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation