DocumentCode
1108109
Title
A Computing Machine Based on Tree Structures
Author
Berkling, Klaus J.
Issue
4
fYear
1971
fDate
4/1/1971 12:00:00 AM
Firstpage
404
Lastpage
418
Abstract
The expenditure of resources to provide via software more structure and more function in conventional machines has become excessive. The answer to this problem may consist in providing more structure and more function in hardware. With respect to structure, we describe 1) the binary tree as basic data and control structure, 2) the implementation of a binary tree by a conventional memory, and 3) the associated hardware. The most important enhancement with respect to function, the newly introduced unit of action, deals with the handling of variables and substitution.
Keywords
Compiling, control structure, lambda calculus, language-directed computer design, list processing, parallelism, system architecture, tree addressing, tree structures, tree traversal.; Binary trees; Calculus; Computer architecture; Computer languages; Control systems; Costs; Hardware; Parallel processing; Parallel programming; Tree data structures; Compiling, control structure, lambda calculus, language-directed computer design, list processing, parallelism, system architecture, tree addressing, tree structures, tree traversal.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223256
Filename
1671849
Link To Document