Confluence of conditional rewrite systems

Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar

研究成果: Conference contribution

46 被引用数 (Scopus)

抄録

Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether “joinability of critical pairs” is, in general, sufficient for confluence of terminating conditional systems. We review known sufficient conditions for confluence, and also prove two new positive results for systems having critical pairs and arbitrarily big terms in conditions.

本文言語English
ホスト出版物のタイトルConditional Term Rewriting Systems - 1st International Workshop, Proceedings
編集者Stephane Kaplan, Jean-Pierre Jouannaud
出版社Springer Verlag
ページ31-44
ページ数14
ISBN(印刷版)9783540192428
DOI
出版ステータスPublished - 1988
外部発表はい
イベント1st International Workshop on Conditional Term Rewriting Systems, 1987 - Orsay, France
継続期間: 1987 7月 81987 7月 10

出版物シリーズ

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

Other

Other1st International Workshop on Conditional Term Rewriting Systems, 1987
国/地域France
CityOrsay
Period87/7/887/7/10

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル