Abstract
We study the question of efficiency improvement or deterioration for a semantics-preserving program transformation technique for (lazy) functional languages, based on composition of restricted macro tree transducers. By annotating programs to reflect the intensional property "computation time" explicitly in the computed output and by manipulating such annotations, we formally prove syntactic conditions under which the composed program is guaranteed to be no less efficient than the original program with respect to the number of call-by-need reduction steps required to reach normal form. The criteria developed can be checked automatically and efficiently, and thus they are suitable for integration into an optimizing compiler.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Voigtlander, J. Formal Efficiency Analysis for Tree Transducer Composition. Theory Comput Syst 41, 619–689 (2007). https://doi.org/10.1007/s00224-006-1235-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-006-1235-9