Mutually Recursive Data

2021 ◽  
pp. 401-431
Author(s):  
Marco Morazán
Keyword(s):  
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.

Compiler-based prefetching for recursive data structures

1996 ◽  
Vol 30 (5) ◽  
pp. 222-233 ◽  
Author(s):  
Chi-Keung Luk ◽  
Todd C. Mowry
Keyword(s):  
Data Structures ◽  
Recursive Data Structures ◽  
Recursive Data

scholarly journals An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types

2007 ◽  
Vol 174 (8) ◽  
pp. 23-37 ◽  
Author(s):  
Clark Barrett ◽  
Igor Shikanian ◽  
Cesare Tinelli
Keyword(s):  
Decision Procedure ◽  
Data Types ◽  
Recursive Data

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

Parsing Character Arrays by Recursive Scoping and Structuring Using the Example of VRML Data

2021 ◽  
Vol 27 (4) ◽  
pp. 188-194
Author(s):  
D. V. Malakhovetsky ◽  
◽  
A. I. Razumowsky ◽  
Keyword(s):  
Data Storage ◽  
Heterogeneous Systems ◽  
Complex Object ◽  
Hierarchical Data ◽  
Analysis Method ◽  
Algorithmic Design ◽  
Parsing Algorithm ◽  
Recursive Data ◽  
Storage Structures ◽  
The Internet Of Things

Parsing character arrays by recursive scoping and structuring using the example of VRML data. The article presents a new method for structuring, segmentation and algorithmic design of the parser of character arrays using the example of VRML data. The key feature of the method is the ability to form a hierarchically complex object by means of recursive data structuring, which makes it possible to cover in aggregate the entire contents of the object, including its arbitrary nesting of child objects. This leads to high controllability of the development of the parsing algorithm, allowing you to focus each time on a specific piece of data, while not losing sight of the entire aggregate connectivity of information. The results obtained can easily be used in plans for creating convenient data storage structures related to information security, solving the problem of containing the amount of data in files, managing big data in heterogeneous systems, and processing hierarchical data in the Internet of Things. Keywords: data analysis method, parsing, structuring, se

Sign in / Sign up

Export Citation Format

Share Document