Program Transformation Templates for Tupling Based on Term Rewriting

Takahito AOTO
Yoshihito TOYAMA

IEICE TRANSACTIONS on Information and Systems   Vol.E93-D    No.5    pp.963-973
Publication Date: 2010/05/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E93.D.963
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Formal Approach)
Category: Program Transformation
program transformation,  tupling,  term rewriting,  

Full Text: PDF(264KB)>>
Buy this Article

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.

open access publishing via