|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/10608
|
| Title: | Uncurrying for Termination and Complexity |
| Authors: | Hirokawa, Nao
Middeldorp, Aart
Zankl, Harald |
| Keywords: | Term Rewriting
Termination
Complexity
Uncurrying |
| Issue Date: | 2012-04-25 |
| Publisher: | Springer |
| Magazine name: | Journal of Automated Reasoning |
| Volume: | 50 |
| Number: | 3 |
| Start page: | 279 |
| End page: | 315 |
| DOI: | 10.1007/s10817-012-9248-3 |
| Abstract: | First-order applicative rewrite systems provide a natural framework for modeling higher-order aspects. In this article we present a transformation from untyped applicative term rewrite systems to functional term rewrite systems that preserves and reflects termination. Our transformation is less restrictive than other approaches. In particular, head variables in right-hand sides of rewrite rules can be handled. To further increase the applicability of our transformation, we study the method for innermost rewriting and derivational complexity, and present a version for dependency pairs. |
| Rights: | This is the author-created version of Springer, Nao Hirokawa, Aart Middeldorp, and Harald Zankl, Journal of Automated Reasoning, 50(3), 2012, 279-315. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s10817-012-9248-3 |
| URI: | https://hdl.handle.net/10119/10608 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 17999.pdf | | 534Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
