Program Transformation Templates For Tupling Based On Term Rewriting
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS(2010)
摘要
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.
更多查看译文
关键词
program transformation, tupling, term rewriting
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络