Improving recursive functions by inverting the order of evaluation

Boiten, E.A. (1992) Improving recursive functions by inverting the order of evaluation. Science of Computer Programming, 18 . pp. 139-179. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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.

Item Type: Article
Uncontrolled keywords: program transformation, tabulation, memoisation
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 07 Aug 2009 22:23
Last Modified: 07 Aug 2009 22:23
Resource URI: http://kar.kent.ac.uk/id/eprint/21081 (The current URI for this page, for reference purposes)
  • Depositors only (login required):