WEKO3
アイテム
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
http://hdl.handle.net/2237/21171
http://hdl.handle.net/2237/21171a09e8499-7c24-40a2-8bf5-6de2cae8bdc7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
17.pdf (503.8 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2015-01-30 | |||||
| タイトル | ||||||
| タイトル | Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity | |||||
| 言語 | en | |||||
| 著者 |
Nishida, Naoki
× Nishida, Naoki× Sakai, Masahiko× Sakabe, Toshiki |
|||||
| アクセス権 | ||||||
| アクセス権 | open access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | conditional term rewriting | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | program transformation | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound for every CTRS w.r.t. reduction, while they are complete w.r.t. reduction. Here, soundness w.r.t. reduction means that every reduction sequence of the corresponding unraveled TRS, of which the initial and end terms are over the original signature, can be simulated by the reduction of the original CTRS. In this paper, we show that an optimized variant of Ohlebusch’s unraveling for deterministic CTRSs is sound w.r.t. reduction if the corresponding unraveled TRSs are left-linear or both right-linear and non-erasing. We also show that soundness of the variant implies that of Ohlebusch’s unraveling. | |||||
| 言語 | en | |||||
| 内容記述 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | RTA 2011 - 22nd Rewriting Techniques and Applications (Monday, May 30, 2011 to Wednesday, June 1, 2011, Novi Sad) Part of RDP'11 | |||||
| 出版者 | ||||||
| 出版者 | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | journal article | |||||
| 出版タイプ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
| DOI | ||||||
| 関連タイプ | isVersionOf | |||||
| 識別子タイプ | DOI | |||||
| 関連識別子 | https://doi.org/10.4230/LIPIcs.RTA.2011.267 | |||||
| ISBN | ||||||
| 関連タイプ | isPartOf | |||||
| 識別子タイプ | ISBN | |||||
| 関連識別子 | 978-3-939897-30-9 | |||||
| ISSN | ||||||
| 収録物識別子タイプ | EISSN | |||||
| 収録物識別子 | 1868-8969 | |||||
| 書誌情報 |
en : Leibniz International Proceedings in Informatics (LIPIcs) : 22nd International Conference on Rewriting Techniques and Applications (RTA'11) 巻 10, p. 267-282, 発行日 2011 |
|||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| URI | ||||||
| 識別子 | http://hdl.handle.net/2237/21171 | |||||
| 識別子タイプ | HDL | |||||
| URI | ||||||
| 識別子 | http://dx.doi.org/10.4230/LIPIcs.RTA.2011.267 | |||||
| 識別子タイプ | DOI | |||||
