Program Transformation Templates for Tupling Based on Term Rewriting
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.5 pp.963-973
- Publication Date
- 2010/05/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.963
- Type of Manuscript
- Special Section PAPER (Special Section on Formal Approach)
- Category
- Program Transformation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yuki CHIBA, Takahito AOTO, Yoshihito TOYAMA, "Program Transformation Templates for Tupling Based on Term Rewriting" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 5, pp. 963-973, May 2010, doi: 10.1587/transinf.E93.D.963.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.963/_p
Copy
@ARTICLE{e93-d_5_963,
author={Yuki CHIBA, Takahito AOTO, Yoshihito TOYAMA, },
journal={IEICE TRANSACTIONS on Information},
title={Program Transformation Templates for Tupling Based on Term Rewriting},
year={2010},
volume={E93-D},
number={5},
pages={963-973},
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.},
keywords={},
doi={10.1587/transinf.E93.D.963},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - Program Transformation Templates for Tupling Based on Term Rewriting
T2 - IEICE TRANSACTIONS on Information
SP - 963
EP - 973
AU - Yuki CHIBA
AU - Takahito AOTO
AU - Yoshihito TOYAMA
PY - 2010
DO - 10.1587/transinf.E93.D.963
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2010
AB - 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.
ER -
English
