Priority rewriting: Semantics, confluence, and conditionals

Research output: Chapter in Book/Entry/PoemConference contribution

10 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationRewriting Techniques and Applications - 3rd International Conference, RTA 1989
EditorsNachum Dershowitz
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540510819
StatePublished - 1989
Event3rd International Conference on Rewriting Techniques and Applications, RTA 1989 - Chapel Hill, United States
Duration: Apr 3 1989Apr 5 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume355 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd International Conference on Rewriting Techniques and Applications, RTA 1989
Country/TerritoryUnited States
CityChapel Hill

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Priority rewriting: Semantics, confluence, and conditionals'. Together they form a unique fingerprint.

Cite this