On composable properties of term rewriting systems

Takahito Aoto, Yoshihito Toyama

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

A property of term rewriting system (TRS, for short) is said to be composable if it is preserved under unions. We present composable properties of TRSs on the base of modularity results for direct sums of TRSs. We propose a decomposition by a naive sort attachment, and show that modular properties for direct sums of TRSs are τ-composable for a naive sort attachment τ. Here, a decomposition of a TRS R is a pair (R 1,R 2) of (not necessary disjoint) subsets of R such that R = R 1 U R 2; and for a naive sort attachment T a property ø of TRSs is said to be τ-composable if for any TRS R such that τ is consistent withR, ø(R1) Λ φ(R2) implies φ(R) where (R 1, R 2) is the decomposition of R by τ.

本文言語English
ホスト出版物のタイトルAlgebraic and Logic Programming - 6th International Joint Conference ALP 1997 ― HOA 1997, Proceedings
編集者Karl Meinke, Michael Hanus, Jan Heering
出版社Springer-Verlag
ページ114-128
ページ数15
ISBN(印刷版)3540634592, 9783540634591
DOI
出版ステータスPublished - 1997 1 1
イベント6th International Conference on Algebraic and Logic Programming, ALP 1997 - Southampton, United Kingdom
継続期間: 1997 9 31997 9 5

出版物シリーズ

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

Other

Other6th International Conference on Algebraic and Logic Programming, ALP 1997
CountryUnited Kingdom
CitySouthampton
Period97/9/397/9/5

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

引用スタイル