Persistence of Termination for Non-Overlapping 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 presentation, we show that termination is persistent for non-overlapping term rewriting systems and we give the example as application of this result. Furthermore we obtain that completeness is persistent for non-overlapping term rewriting systems. (Presented October 15, 2003)

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

著者

• Iwami Munehiro

  Faculty Of Information Science Japan Advanced Institute Of Science And Technology

• Iwami Munehiro

  Faculty Of Science And Engineering Shimane University

関連論文

• An Improved Recursive Decomposition Ordering for Higher-Order Rewrite Systems
• Persistence of Termination for Non-Overlapping Term Rewriting Systems
• Simplification Ordering for Higher-Order Rewrite Systems

スポンサーリンク