Tupling is a transformation tactic to obtain new functions, without redundant calls and/or multiple traversals of common inputs. In [Chi93], we presented an automatic method for tupling functions with a single recursion parameter each. In this paper, we propose a new family of parameter analyses, called synchronization analyses, to help extend the tupling method to functions with multiple recursion parameters. To achieve better optimisation, we formulate three different forms of tupling optimisations for the elimination of intra-call traversals, the elimination of inter-call traversals and the elimination of redundant calls. We also guarantee the safety of the extended method by ensuring that its transformation terminates.
CITATION STYLE
Chin, W. N., Khoo, S. C., & Thiemann, P. (1996). Synchronization analyses for multiple recursion parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1110, pp. 33–53). Springer Verlag. https://doi.org/10.1007/3-540-61580-6_3
Mendeley helps you to discover research relevant for your work.