A comparative revisitation of some program transformation techniques

20Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based program derivation, program specialization, compiling control, and the like. We present a methodology which underlines these techniques as a ‘common pattern of reasoning’ and explains the various correspondences which can be established among them. This methodology consists of three steps: i) symbolic computation, ii) search for regularities, and iii) program extraction. We also discuss some control issues which occur when performing these steps.

Cite

CITATION STYLE

APA

Pettorossi, A., & Proietti, M. (1996). A comparative revisitation of some program transformation techniques. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1110, pp. 355–386). Springer Verlag. https://doi.org/10.1007/3-540-61580-6_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free