This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Computing Machine Based on Tree Structures
April 1971 (vol. 20 no. 4)
pp. 404-418
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.
Index Terms:
Compiling, control structure, lambda calculus, language-directed computer design, list processing, parallelism, system architecture, tree addressing, tree structures, tree traversal.
Citation:
K.J. Berkling, "A Computing Machine Based on Tree Structures," IEEE Transactions on Computers, vol. 20, no. 4, pp. 404-418, April 1971, doi:10.1109/T-C.1971.223256
Usage of this product signifies your acceptance of the Terms of Use.