Subrecursive Programming Language III, The Multiple Recursive Functions, $\Re^{n}$
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
The characterization of program structure is an elusive aspect of the theory of programming languages. Contingent on such a characterization is an interesting study of the trade-off relationships between program structure and efficiency, between structure and intelligibility, between structure and size, and so forth. One promising definition of program structure is suggested by the studies of the structure of recursion schemata pursued by logicians in the 1930's. In this paper we carry over some of these ideas to programming and present new computer-oriented definitions of certain well-known classes of recursive functions, namely the multiple recursive,