Confluence of conditional rewrite systems

Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar

研究成果: Conference contribution

41 引用 (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
出版者Springer Verlag
ページ31-44
ページ数14
308 LNCS
ISBN(印刷物)9783540192428
DOI
出版物ステータスPublished - 1988 1 1
外部発表Yes
イベント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
Orsay
期間87/7/887/7/10

    フィンガープリント

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Dershowitz, N., Okada, M., & Sivakumar, G. (1988). Confluence of conditional rewrite systems. : Conditional Term Rewriting Systems - 1st International Workshop, Proceedings (巻 308 LNCS, pp. 31-44). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 308 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-19242-5_3