| Presentation | 2004-08-03 On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems Naoki NISHIDA, Masahiko SAKAI, Toshiki SAKABE, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Transformations from conditional term rewriting systems (CTRSs) over (original) signatures into term rewriting systems (TRSs) over the exteded signatures, are called unravelings. They are not always simulation-complete for any input CTRS. Here simulation-completeness means that every rewrite sequence of the unraveled CTRSs (the output TRSs), whose initial and final terms are over the original signatures, can be simulated by a rewrite sequence of the original CTRSs. We have proposed an unraveling which generates left-linear, right-linear and non-erasing TRSs from CTRSs satisfying some syntactic conditions, respectively. In this paper, we show two conditions that the unraveling is simulation-complete for CTRSs. One is that the unraveled CTRSs are right-linear and non-erasing, and the other is that they are left-linear. Under the latter condition, we assume that any redex introduced by extra variables is not reduced anywhere in the rewrite sequences of the unraveled CTRSs. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | program transformation / right-linearity / non-erasingness / left-linearity / extra variable |
| Paper # | SS2004-18 |
| Date of Issue |
| Conference Information | |
| Committee | SS |
|---|---|
| Conference Date | 2004/7/27(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Software Science (SS) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems |
| Sub Title (in English) | |
| Keyword(1) | program transformation |
| Keyword(2) | right-linearity |
| Keyword(3) | non-erasingness |
| Keyword(4) | left-linearity |
| Keyword(5) | extra variable |
| 1st Author's Name | Naoki NISHIDA |
| 1st Author's Affiliation | Graduate School of Information Science, Nagoya University() |
| 2nd Author's Name | Masahiko SAKAI |
| 2nd Author's Affiliation | Graduate School of Information Science, Nagoya University |
| 3rd Author's Name | Toshiki SAKABE |
| 3rd Author's Affiliation | Graduate School of Information Science, Nagoya University |
| Date | 2004-08-03 |
| Paper # | SS2004-18 |
| Volume (vol) | vol.104 |
| Number (no) | 243 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |