Canonical conditional rewrite systems

Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar

研究成果: Conference contribution

43 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル9th International Conference on Automated Deduction, Proceedings
編集者Ewing Lusk, Ross Overbeek
出版社Springer Verlag
ページ538-549
ページ数12
ISBN(印刷版)9783540193432
DOI
出版ステータスPublished - 1988
イベント9th International Conference on Automated Deduction, CADE 1988 - Argonne, United States
継続期間: 1988 5 231988 5 26

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
310 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other9th International Conference on Automated Deduction, CADE 1988
CountryUnited States
CityArgonne
Period88/5/2388/5/26

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Canonical conditional rewrite systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル