The paper presents a synthetic view of transformations that invert the order of evaluation of recursive functions. Techniques for linear recursive functions are presented. A consideration of stacks motivates the introduction of a general control structure for tabulation. Several transformations for tree-like recursive functions are given. © 1992.
Boiten, E. A. (1992). Improving recursive functions by inverting the order of evaluation. Science of Computer Programming, 18(2), 139–179. https://doi.org/10.1016/0167-6423(92)90008-Y