Improving recursive functions by inverting the order of evaluation

  • Boiten E
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 9

    Citations

    Citations of this article.

Abstract

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free