WEKO3
アイテム
Transformation for Refining Unraveled Conditional Term Rewriting Systems
http://hdl.handle.net/2237/9243
http://hdl.handle.net/2237/92433290d396-2ba9-4a14-971c-c932d6277090
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-01-07 | |||||
タイトル | ||||||
タイトル | Transformation for Refining Unraveled Conditional Term Rewriting Systems | |||||
言語 | en | |||||
著者 |
Nishida, Naoki
× Nishida, Naoki× Mizutani, Tomohiro× Sakai, Masahiko |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
抄録 | ||||||
内容記述 | Unravelings, which transform conditional term rewriting systems (CTRSs) into unconditional term rewriting systems, are useful for analyzing properties of CTRSs. To compute reduction sequences of CTRSs, the restriction by a particular context-sensitive and membership condition is imposed on reductions of the unraveled CTRSs. The condition is determined by extra function symbols introduced due to the unravelings. In this paper, we propose a method to weaken the restriction, that is, to reduce the number of extra symbols. We first improve the unraveling for deterministic CTRSs, and then propose a transformation that folds to two successively used rewrite rules in the unraveled CTRSs, which satisfy a condition, to a rewrite rule that simulates reductions by the two rules. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
書誌情報 |
en : Proceedings of 6th International Workshop on Reduction Strategies in Rewriting and Programming, Seattle, 2006 p. 34-48, 発行日 2007 |
|||||
フォーマット | ||||||
application/pdf | ||||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/9243 | |||||
識別子タイプ | HDL |