2026-05-21T05:59:14Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00016647 2025-01-22T23:45:43Z 934:935:954:958

Persistence of Termination for Overlay Term Rewriting Systems Persistence of Termination for Overlay Term Rewriting Systems Munehiro, Iwami Munehiro, Iwami 発表概要 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. 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 eng journal article https://ipsj.ixsq.nii.ac.jp/records/16647 1882-7802 AA11464814 情報処理学会論文誌プログラミング（PRO） 46 SIG1(PRO24) 150 150 https://ipsj.ixsq.nii.ac.jp/record/16647/files/IPSJ-TPRO4601015.pdf application/pdf 25.1 kB 2007-01-15