Skip to main content
SpringerLink
Log in

Priority rewriting: Semantics, confluence, and conditionals

  • Regular Papers
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1989)

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

Included in the following conference series:

Abstract

Priority rewrite systems (PRS) are partially ordered finite sets of rewrite rules; in this paper, two possible alternative definitions for rewriting with PRS are examined. A logical semantics for priority rewriting is described, using equational formulas obtained from the rules, and inequations which must be assumed to permit rewriting with rules of lower priority. Towards the goal of using PRS to define data type and function specifications, restrictions are given that ensure confluence and encourage modularity. Finally, the relation between priority and conditional rewriting is studied, and a natural combination of these mechanisms is proposed.

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. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Term Rewriting Systems with Priorities, Proc. II Conf. Rewriting Techniques and Applications, France, Springer-Verlag LNCS 256, 1987, pp83–94.

    Google Scholar 

  2. J.A. Bergstra, J.W. Klop, Conditional Rewrite Rules: Confluency and Termination Res. Rep. IW 198/82, Center for Math. and Comp. Sci., Amsterdam, 1982 (also in JCSS 32, pp.323–362, 1986).

    Google Scholar 

  3. D. Brand, J.A. Darringer, W. Joyner, Completeness of Conditional Reductions, Res. Rep. RC7404, IBM T.J. Watson Res. Center, Yorktown Heights (NY), 1978.

    Google Scholar 

  4. N. Dershowitz, Termination of Rewriting, Proc. First Int'l. Conf. on Rewriting Techniques and Applications, Dijon (France), 1985, Springer-Verlag LNCS 202, pp180–224.

    Google Scholar 

  5. H. Ganzinger, Ground term confluence in parametric conditional equational specifications, Proc. STACS 87, pp286–298, 1987.

    Google Scholar 

  6. J.V. Guttag, J.J. Horning, The Algebraic Specification of Abstract Data Types, Acta Informatica 10, 1978, pp27–52.

    Google Scholar 

  7. G.Huet, D.S.Oppen, Equations and Rewrite Rules: A Survey, in Formal Languages: Perspectives and Open Problems, R.Book (ed.), Academic Press, 1980, pp349–405.

    Google Scholar 

  8. J.-P. Jouannaud, E. Kounalis, Proofs by Induction in Equational Theories without Constructors, Symp. on Logic in C.S., Cambridge (Mass.), USA, 1986, pp358–366.

    Google Scholar 

  9. S. Kaplan, Conditional Rewrite Rules, Theoretical Computer Science 33, 1984, pp175–193.

    Google Scholar 

  10. S. Kaplan, Positive/Negative Conditional Rewriting, Proc. First Int'l. Workshop on Conditional Term Rewriting Systems, Orsay (France), Springer-Verlag LNCS 308, 1988, pp129–143.

    Google Scholar 

  11. S.Kaplan, J.-P.Jouannaud (eds.), Proc. First Int'l. Workshop on Conditional Term Rewriting Systems, Orsay (France), Springer-Verlag LNCS 308, 1988.

    Google Scholar 

  12. J.W. Klop, Term Rewriting Systems: a tutorial, Rep. IR 126, Centre for Math. & C.S., Amsterdam, 1987.

    Google Scholar 

  13. E. Kounalis, Completeness in Data Type Specifications, Res. Rep. 84-R-92, C.R.I.N., Nancy (France), 1984.

    Google Scholar 

  14. C.K.Mohan, Negation in Equational Reasoning and Conditional Specifications, Ph.D. Thesis, State University of New York at Stony Brook, 1988.

    Google Scholar 

  15. C.K.Mohan, Priority Rewriting: Semantics, Confluence and Conditionals, Tech.Rep. CIS-88-6, Syracuse University, Nov. 1988.

    Google Scholar 

  16. C.K. Mohan, M.K. Srivas, Conditional Specifications with Inequational Assumptions, Proc. First Int'l. Workshop on Conditional Term Rewriting Systems, Orsay (France), Springer-Verlag LNCS 308, 1988, pp161–178.

    Google Scholar 

  17. J.-L. Remy, Etudes des systemes de reecriture conditionnels et application aux types abstraits algebriques, These d'Etat, Nancy (France), 1982.

    Google Scholar 

  18. J.J.Thiel, Stop Losing Sleep over Incomplete Specifications, Proc. 11th ACM Symp. on Princ. of Prog. Lang., 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Science, Syracuse University, 13244-4100, Syracuse, NY

    Chilukuri K. Mohan

Authors
  1. Chilukuri K. Mohan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mohan, C.K. (1989). Priority rewriting: Semantics, confluence, and conditionals. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_114

Download citation

  • DOI: https://doi.org/10.1007/3-540-51081-8_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51081-9

  • Online ISBN: 978-3-540-46149-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation