Program Transformation Templates for Tupling Based on Term Rewriting
スポンサーリンク
概要
- 論文の詳細を見る
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.
- The Institute of Electronics, Information and Communication Engineers (IEICE)の論文
- 2010-05-01
著者
-
AOTO TAKAHITO
RIEC, Tohoku University
-
Chiba Yuki
Japan Advanced Institute Of Science And Technology
-
Toyama Yoshihito
Riec Tohoku University
-
Aoto Takahito
Riec Tohoku University
-
TOYAMA Yoshihito
RIEC, Tohoku University
関連論文
- Soundness of Rewriting Induction Based on an Abstract Principle
- Program Transformation Templates for Tupling Based on Term Rewriting
- Automatic Construction of Program Transformation Templates
- Program Transformation by Templates : A Rewriting Framework
- Soundness of Rewriting Induction Based on an Abstract Principle