An Empirical Study of List Structure in Lisp

Communications of the ACM

Volumn 20, Issue 2, 1977, Pages 78-87

  Clark, Douglas W ^a   Green, C Cordell ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Lisp; list linearization; list structure measurement; list structure regularity; pointer compression; pointer entropy; Zipf's law

Indexed keywords

DATA PROCESSING - DATA STRUCTURES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0017458251     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359423.359427     Document Type: Article

References (23)

1. Barnett, J.A., and Long, R.E. The SDC LISP 1.5 system for IBM 360 computers. System Development Corp., Santa Monica, Calif., Jan. 1968.
2. Bates, M. The use of syntax in a speech understanding system, IEEE Trans. Acoustics, Speech, and Signal Processing 23, 1 (Feb. 1975), 112-117.
3. Bobrow, D.G. A note on hash linking. Comm. ACM 18, 7 (July 1975), 413-415.
4. Bobrow, D.G., Burchfiel, J.D., Murphy, D.L., and Tomlinson R.S. TENEX, a paged time sharing system for the PDP-10. Comm. ACM 15, 3 (March 1972), 135-143.
5. Bobrow, D.G., and Murphy, D.L. The structure of a LISP system using two level storage. Comm. ACM 10, 3 (March 1967). 155-159.
6. Cheney, C.J. A nonrecursive list compacting algorithm. Comm. ACM 13, 11 (Nov. 1970), 677-678.
7. Deutsch, L.P. An interactive program verifier. Ph.D. Th., Comptr. Sci. Dep., U. of California, Berkeley, Calif., May 1973.
8. Deutsch, L.P. A LISP machine with very compact programs. Third Int. Joint Conf. on Artificial Intelligence, Stanford, Calif., 1973, pp. 697-703.
9. Fenichel, R.R., and Yochelson, J.C. A LISP garbage-collector for virtual-memory computer systems. Comm. ACM 12, 11 (Nov. 1969), 611-612.
10. Hansen, W.J. Compact list representation: Definition, garbage collection, and system implementation. Comm. ACM 12, 9 (Sept. 1969), 499-507.
11. Hehner, E.C.R. Matching program and data representations to a computing environment. Ph.D. Th., Comptr. Systems Res. Group, U. of Toronto, Toronto, Canada, Nov. 1974.
12. McCarthy, J., et al. LISP 1.5 Programmer's Manual. M.I.T. Press, Cambridge, Mass., 1962.
13. Minsky, M.L. A LISP garbage collector algorithm using serial secondary storage. Artificial Intelligence Proj. Memo 58 (rev.), Project MAC, M.I.T., Cambridge, Mass., Dec. 1963.
14. Quam, L.H. Stanford LISP 1.6 manual. Artificial Intelligence Proj., Stanford University, Stanford, Calif., Sept. 1969.
15. Reboh, R., and Sacerdoti, E. A preliminary QLISP manual. Tech. Note 81, Stanford Res. Inst. AI Center, Menlo Park, Calif., Aug. 1973.
16. Sacerdoti, E. The nonlinear nature of plans. Fourth Int. Joint Conf. on Artificial Intelligence, Tbilisi, Georgia, U.S.S.R., 1975, pp. 206-214.
17. Shannon, C.E. A mathematic theory of communication. Bell System Tech. J. 27 (July 1948), 379-423.
18. Smith, D.H., Masinter, L.M., and Sridharan, N.S. Heuristic DENDRAL: Analysis of molecular structure. In Computer Representation and Manipulation of Chemical Information. W.T. Wipke, S. Heller, R. Feldman, and É. Hyde, Eds., Wiley, New York, 1974.
19. Teitelman, W. INTERLISP Reference manual. Xerox Palo Alto Res. Center, Palo Alto, Calif., 1974.
20. Van der Poel, W.L. A Manual of HISP for the PDP-9. Technical U., Delft, Netherlands.
21. Weissman, C. LISP 1.5 Primer. Dickenson Pub. Co., Belmont, Calif., 1967.
22. Wilner, W.T. Design of the B1700. Proc. AFIPS 1972 FJCC, Vol. 41, AFIPS Press, Montvale, N.J., pp. 579-586.
23. Zipf, G.K. Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading, Mass., 1949.