Completeness of combinations of constructor systems

Aart Middeldorp, Yoshihito Toyama

研究成果: Conference contribution

17 被引用数 (Scopus)

抄録

A term rewriting system is called complete if it is both confluent and strongly normalizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRS’s. In this paper we show that it is sufficient to impose the constructor discipline for obtaining the modularity of completeness. This result is a simple consequence of a quite powerful divide and conquer technique for establishing completeness of such constructor systems. Our approach is not limited to systems which are composed of disjoint parts. The importance of our method is that we may decompose a given constructor system into parts which possibly share function symbols and rewrite rules in order to infer completeness. We obtain a similar technique for semi-completeness, i.e. the combination of confluence and weak normalization.

本文言語English
ホスト出版物のタイトルRewriting Techniques and Applications - 4th International Conference, RTA-1991, Proceedings
編集者Ronald V. Book
出版社Springer Verlag
ページ188-199
ページ数12
ISBN(印刷版)9783540539049
DOI
出版ステータスPublished - 1991
イベント4th International Conference on Rewriting Techniques and Applications, RTA-1991 - Como, Italy
継続期間: 1991 4 101991 4 12

出版物シリーズ

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

Other

Other4th International Conference on Rewriting Techniques and Applications, RTA-1991
CountryItaly
CityComo
Period91/4/1091/4/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

引用スタイル