Canonical conditional rewrite systems

Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Conditional equations have been studied for their use in the specification of abstract data types and as a computational paradigm that combines logic and function programming in a clean way. In this paper we examine different formulations of conditional equations as rewrite systems, compare their expressive power and give sufficient conditions for rewrite systems to have the “confluence” property. We then examine a restriction of these systems using a “decreasing” ordering. With this restriction, most of the basic notions (like rewriting and computing normal forms) are decidable, the “critical pair” lemma holds, and some formulations preserve canonicity.

Original languageEnglish
Title of host publication9th International Conference on Automated Deduction, Proceedings
EditorsEwing Lusk, Ross Overbeek
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540193432
StatePublished - 1988
Externally publishedYes
Event9th International Conference on Automated Deduction, CADE 1988 - Argonne, United States
Duration: 23 May 198826 May 1988

Publication series

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


Conference9th International Conference on Automated Deduction, CADE 1988
Country/TerritoryUnited States


Dive into the research topics of 'Canonical conditional rewrite systems'. Together they form a unique fingerprint.

Cite this