Access Restriction

Author Strong, H. R. ♦ Walker, S. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract In this paper we report research which is going on at present. Rather than presenting major results, we have selected a number of partial results and techniques in order to indicate a direction we think is promising. In the first section we review methods for converting a program with a calling structure involving recursion into one without such a structure. In the second section we discuss the separation of the aspects of control and storage in this recursion removal process. We show, by example, how the separation provides the possibility of preserving properties other than functional equivalence. These two sections provide a slight generalization of and complement work presented in the expository paper [S2]. In this third section we illustrate implications of invertibility of operations with respect to the recursion removal process. The central example of this section is the Ackerman functional, obtained by schematizing a version of the Ackerman function. With this example, we note that a recursion need not be convertible to a primitive recursion in order to be removable.
Description Affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, New York (Strong, H. R.; Walker, S. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-06-30
Publisher Place New York
Journal ACM SIGACT News (SIGA)
Issue Number 14
Page Count 7
Starting Page 97
Ending Page 103

Open content in new tab

   Open content in new tab
Source: ACM Digital Library