Affiliation:
1. Bolt Beranek and Newman, Inc., Cambridge, MA
Abstract
In an ideal list-processing system there would be enough core memory to contain all the data and programs. Described in this paper are a number of techniques that have been used to build a LISP system utilizing a drum for its principal storage medium, with a surprisingly low time penalty for use of this slow storage device. The techniques include careful segmentation of system programs, allocation of virtual memory to allow address arithmetic for type determination, and a special algorithm for building reasonably linearized lists. A scheme for binding variables is described which is good in this environment and allows for complete compatibility between compiled and interpreted programs with no special declarations.
Publisher
Association for Computing Machinery (ACM)
Reference6 articles.
1. BERKELEY E. G. AND BOBROW D. G. (EDs.) The Programming Language LISP Its Operation and Applications. MIT Press Cambridge Mass. 1966. BERKELEY E. G. AND BOBROW D. G. (EDs.) The Programming Language LISP Its Operation and Applications. MIT Press Cambridge Mass. 1966.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hygienic macro technology;Proceedings of the ACM on Programming Languages;2020-06-12
2. Waste not, want not;ACM SIGPLAN Notices;2011-11-18
3. Eventrons;ACM SIGPLAN Notices;2006-06-11
4. Syncopation;ACM SIGPLAN Notices;2005-07-12
5. Garbage collection without paging;ACM SIGPLAN Notices;2005-06-12