Name
Abstract | ||
|---|---|---|
Chiba et al. (2006) proposed a framework of program transformation of term rewriting systems by developed templates. Contrast to the previous framework of program transformation by templates based on lambda calculus, this framework provides a method to verify the correctness of transformation automatically. Tupling (Bird, 1980) is a well-known technique to eliminate redundant recursive calls for improving efficiency of programs. In Chiba et al's framework, however, one can not use tuple symbols to construct developed templates. Thus their framework is not capable of tupling transformations. In this paper, we propose a more flexible notion of templates so that a wider variety of transformations, including tupling transformations, can be handled. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1587/transinf.E93.D.963 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
program transformation, tupling, term rewriting | Lambda calculus,Programming language,Program transformation,Computer science,Tuple,Correctness,Theoretical computer science,Rewriting,Template,Recursion | Journal |
Volume | Issue | ISSN |
E93D | 5 | 0916-8532 |
Citations | PageRank | References |
1 | 0.35 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuki Chiba | 1 | 35 | 7.46 |
| Takahito Aoto | 2 | 121 | 17.53 |
| Yoshihito Toyama | 3 | 533 | 49.60 |