scholarly journals Parallelizing programs with recursive data structures

1990 ◽  
Vol 1 (1) ◽  
pp. 35-47 ◽  
Author(s):  
L.J. Hendren ◽  
A. Nicolau
Keyword(s):  
Data Structures ◽  
Recursive Data Structures ◽  
Recursive Data

Preliminaries

2017 ◽  
Author(s):  
David J. Lobina
Keyword(s):  
Data Structures ◽  
Production Systems ◽  
Specific Data ◽  
Recursive Functions ◽  
Recursive Solution ◽  
Partial Recursive Functions ◽  
Recursive Structures ◽  
Recursive Data Structures ◽  
Recursive Data ◽  
The Relationship

Recursion, or the capacity of ‘self-reference’, has played a central role within mathematical approaches to understanding the nature of computation, from the general recursive functions of Alonzo Church to the partial recursive functions of Stephen C. Kleene and the production systems of Emil Post. Recursion has also played a significant role in the analysis and running of certain computational processes within computer science (viz., those with self-calls and deferred operations). Yet the relationship between the mathematical and computer versions of recursion is subtle and intricate. A recursively specified algorithm, for example, may well proceed iteratively if time and space constraints permit; but the nature of specific data structures—viz., recursive data structures—will also return a recursive solution as the most optimal process. In other words, the correspondence between recursive structures and recursive processes is not automatic; it needs to be demonstrated on a case-by-case basis.

Recursive data structures in APL

1979 ◽  
Vol 22 (2) ◽  
pp. 79-96 ◽  
Author(s):  
W. E. Gull ◽  
M. A. Jenkins
Keyword(s):  
Data Structures ◽  
Recursive Data Structures ◽  
Recursive Data
Sign in / Sign up

Export Citation Format

Share Document