|
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/9053
|
| Title: | Uncurrying for Termination |
| Authors: | Hirokawa, Nao
Middeldorp, Aart
Zankl, Harald |
| Issue Date: | 2008 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 5330/2008 |
| Start page: | 667 |
| End page: | 681 |
| DOI: | 10.1007/978-3-540-89439-1_46 |
| Abstract: | First-order applicative term rewrite systems provide a natural framework for modeling higher-order aspects. In this paper 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 present a version for dependency pairs. |
| Rights: | This is the author-created version of Springer, Nao Hirokawa, Aart Middeldorp, and Harald Zankl, Lecture Notes in Computer Science, 5330/2008, 2008, 667-681. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-540-89439-1_46 |
| URI: | https://hdl.handle.net/10119/9053 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 08lpar1.pdf | | 218Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
