Confluent term rewriting systems with membership conditions

Yoshihito Toyama

研究成果: Conference contribution

21 被引用数 (Scopus)

抄録

We propose a new type of conditional term rewriting system: the membership-conditional term rewriting system, in which, each rewriting rule can have membership conditions which restrict the substitution values for the variables occurring in the rule. For example, the rule f(x, x, y) ▹ g(x, y) if x ∈ T' yields the reduction f(M, M, N) → g(M, N) only when M is in the term set T'. Thus, by using membership-conditional rewriting, we can easily provide a strategy for term reduction. We study the confluence of membership-conditional term rewriting systems that are nonterminating and nonlinear. It is shown that a restricted nonlinear term rewriting system in which membership conditions satisfy the closure and termination properties is confluent if the system is nonoverlapping.

本文言語English
ホスト出版物のタイトルConditional Term Rewriting Systems - 1st International Workshop, Proceedings
編集者Stephane Kaplan, Jean-Pierre Jouannaud
出版社Springer-Verlag
ページ228-241
ページ数14
ISBN(印刷版)9783540192428
DOI
出版ステータスPublished - 1988 1 1
イベント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
CountryFrance
CityOrsay
Period87/7/887/7/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

引用スタイル