Persistence of Termination for Overlay Term Rewriting Systems

スポンサーリンク

概要

• 論文の詳細を見る

• A property P is called persistent if for any many-sorted term rewriting system R,R has the property P if and only if term rewriting system [○!-](R), which results from R by omitting its sort information, has the property P. In this talk, we show that termination is persistent for locally confluent overlay term rewriting systems and we give the example as application of this result. Furthermore we show that termination is persistent for right-linear overlay term rewriting systems and we obtain that termination is modular for right-linear overlay term rewriting systems.

• 一般社団法人情報処理学会の論文
• 2005-01-15

著者

• Iwami Munehiro

  Interdisciplinary Faculty Of Science And Engineering Shimane University

関連論文

• Persistence of Termination for Overlay Term Rewriting Systems

スポンサーリンク