WEKO3
アイテム
Persistence of Termination for Overlay Term Rewriting Systems
https://ipsj.ixsq.nii.ac.jp/records/16647
https://ipsj.ixsq.nii.ac.jp/records/16647dca1580b-66e8-4f61-9805-51513e1aea46
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO4601015.pdf (25.1 kB)
|
Copyright (c) 2005 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2005-01-15 | |||||||
| タイトル | ||||||||
| タイトル | Persistence of Termination for Overlay Term Rewriting Systems | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Persistence of Termination for Overlay Term Rewriting Systems | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 発表概要 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Interdisciplinary Faculty of Science and Engineering Shimane University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Interdisciplinary Faculty of Science and Engineering, Shimane University | ||||||||
| 著者名 |
Munehiro, Iwami
× Munehiro, Iwami
|
|||||||
| 著者名(英) |
Munehiro, Iwami
× Munehiro, Iwami
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11464814 | |||||||
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO） 巻 46, 号 SIG1(PRO24), p. 150-150, 発行日 2005-01-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7802 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
