Improving recursive functions by inverting the order of evaluation

Boiten, Eerke Albert (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 currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:21081)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.

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,
Institutional Unit:	Schools > School of Computing
Former Institutional Unit:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Eerke Boiten
Date Deposited:	07 Aug 2009 22:23 UTC
Last Modified:	20 May 2025 10:07 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21081 (The current URI for this page, for reference purposes)

University of Kent Author Information

Boiten, Eerke Albert.

Creator's ORCID:	https://orcid.org/0000-0002-9184-8968
CReDIT Contributor Roles:

Depositors only (login required):

Total Views

Total unique views of this page since July 2020. For more details click on the image.