Abrahams, Paul W. (1963), Machine verification of mathematical proof, M.I.T. PhD thesis in mathematics.
Abrahams, Paul W., Barnett, J., et al., (1966), ``The LISP 2 Programming Language and System'', Proceedings of the Fall Joint Computer Conference, pp. 661-676.
Abrahams, Paul W. (1967), LISP 2 Specifications, Systems Development Corporation Technical report TM-3417/200/00, Santa Monica, Calif.
Allen, John (1978), Anatomy of LISP, McGraw Hill.
Berkeley, Edmund C. and Daniel Bobrow, eds. (1964), The Programming Language LISP, its Operation and Applications, Information International Incorporated, Cambridge, Massachusetts. (out of print).
Burstall, R.M., J.S. Collins and R.J. Popplestone (1968), The POP-2 Papers, Edinburgh University Press, Edinburgh, Scotland.
Burstall, R.M., J.S. Collins and R.J. Popplestone (1971), Programming in POP-2. Edinburgh University Press, Edinburgh, Scotland.
Cartwright, Robert (1976), A practical formal semantic definition and verification system for typed LISP , Stanford Artificial Intelligence Laboratory technical report AIM-296, Stanford, California.
Cartwright, Robert and John McCarthy (1978) ``Representation of Recursive Programs in First Order Logic'' (to be published). (Draft available as FIRST.NEW[W77,JMC] at SU-AI on ARPAnet).
Collins, G.E. (1960) ``A method for overlapping and erasure of lists'', Communications of the ACM, Vol. 3, pp. 655-657.
Church, Alonzo (1941), Calculi of Lambda conversion, Princeton University Press, Princeton, New Jersey.
Fox, Phyllis (1960), LISP I Programmers Manual, Internal paper, MIT, Cambridge, Mass.
Gordon, Michael (1973) Models of Pure LISP, Experimental Programming Reports: No. 31, University of Edinburgh, Edinburgh.
Gelernter, H., J. R. Hansen, and C. L. Gerberich (1960), ``A FORTRAN-Compiled List Processing Language'', Journal of the ACM, Vol. 7, No. 2, pp. 87-101.
Hearn, Anthony (1967), REDUCE, a User-oriented Interactive System for Algebraic Simplification, Stanford Artificial Intelligence Laboratory technical report AIM-57, Stanford, California.
Hewitt, Carl (1971), Description and theoretical analysis (using schemata) of PLANNER: a language for proving theorems and manipulating models in a robot, Ph.D. Thesis, MIT, Cambridge, Mass.
McCarthy, John (1958) ``Programs with common sense'', Proceedings of the Symposium on the Mechanization of Thought Processes, National Physiology Lab, Teddington, England.
McCarthy, J., Minsky, M., et al., (1959a), Quarterly Progress Report No. 52, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, J., Minsky, M., et al., (1959b), Quarterly Progress Report No. 55, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, John (1959c), Letter to the Editor, CACM, Vol. 2, No. 8.
McCarthy, J., Minsky, M., et al., (1960a), Quarterly Progress Report No. 56, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, John (1960b), ``Recursive Functions of Symbolic Expressions and their Computation by Machine, part I'',CACM, Vol. 3, No. 4, pp. 184-195.
McCarthy, J., Minsky, M., et al., (1962a), Quarterly Progress Report, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, J., Minsky, M., et al., (1962b), Quarterly Progress Report No. 64, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, John (1962c), LISP 1.5 Programmer's Manual, (with Abrahams, Edwards, Hart, and Levin), MIT Press, Cambridge, Mass.
McCarthy, J., Minsky, M., et al., (1963a), Quarterly Progress Report No. 68, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, J., Minsky, M., et al., (1963b), Quarterly Progress Report No. 69, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, John (1963c) ``A Basis for a Mathematical Theory of Computation'', in P. Braffort and D. Hirschberg (eds.), Computer Programming and Formal Systems, pp. 33-70. North-Holland Publishing Company, Amsterdam.
McCarthy, John (1963d) ``Towards a Mathematical Science of Computation'', Proceedings of IFIP Congress, Munich 1962, Amsterdam: North-Holland, pp. 21-28.
McCarthy, J., Minsky, M., et al., (1965), Quarterly Progress Report No. 76, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, J., Minsky, M., et al., (1966), Quarterly Progress Report No. 80, Research Lab of Electronics, MIT, Cambridge, Mass.
McCarthy, John and Carolyn Talcott (1979) LISP with Proofs, to be published. Versions of most chapters are available at the Stanford Artificial Intelligence Laboratory.
Marti, J. B., Hearn, A. C., Griss, M. L.and Griss, C. (1978) Standard LISP Report, University of Utah Symbolic Computation Group Report No 60, Provo, Utah.
The Mathlab Group (1977), MACSYMA Reference Manual, Laboratory for Computer Science, MIT Version 9, Cambridge, Mass.
Mitchell, R.W. (1964) LISP 2 Specifications Proposal, Stanford Artificial Intelligence Laboratory Memo No. 21, Stanford, Calif.
Moon, David A. (1974), MACLISP Reference Manual, Project MAC Technical Report, MIT, Cambridge, Mass.
Moses, Joel (1970) The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem", M.I.T. Artificial Intelligence Memo 199, Cambridge, Mass.
Newell, A., and J.C. Shaw (1957) ``Programming the Logic Theory Machine'', Proceedings of the 1957 Western Joint Computer Conference, IRE.
Rulifson, J. et al. (1968), ``QA4 - A Language for Writing Problem-Solving Programs'', Proceeding IFIP 1968 Congress, TA-2, pp 111-115.
Stoyan, Herbert. Herbert Stoyan of Dresden, DDR has completed several chapters on the history of LISP.
Sussman, G. Winograd, T., and Charniak, E. (1970), Microplanner Reference Manual, AI Memo 203, AIL MIT, Camridge, Mass.
Teitelman, Warren (1975), INTERLISP: Interlisp Reference Manual,
Xerox PARC Technical Report, Palo Alto, Calif.
Many reports and memoranda of the M.I.T. and Stanford Artificial Intelligence Laboratories have dealt with various aspects of LISP and higher level systems built on LISP.
APPENDIX - HUMOROUS ANECDOTE
The first on-line demonstration of LISP was also the first of a precursor of time-sharing that we called ``time-stealing''. The audience comprised the participants in one of M.I.T.'s Industrial Liaison Symposia on whom it was important to make a good impression. A Flexowriter had been connected to the IBM 704 and the operating system modified so that it collected characters from the Flexowriter in a buffer when their presence was signalled by an interrupt. Whenever a carriage return occurred, the line was given to LISP for processing. The demonstration depended on the fact that the memory of the computer had just been increased from 8192 words to 32768 words so that batches could be collected that presumed only a small memory.
The demonstration was also one of the first to use closed circuit TV in order to spare the spectators the museum feet consequent on crowding around a terminal waiting for something to happen. Thus they were on the fourth floor, and I was in the first floor computer room exercising LISP and speaking into a microphone. The problem chosen was to determine whether a first order differential equation of the form was exact by testing whether , which also involved some primitive algebraic simplification.
Everything was going well, if slowly, when suddenly the Flexowriter began to type (at ten characters per second)
``THE GARBAGE COLLECTOR HAS BEEN CALLED. SOME INTERESTING STATISTICS ARE AS FOLLOWS:''
and on and on and on. The garbage collector was quite new at the time, we were rather proud of it and curious about it, and our normal output was on a line printer, so it printed a full page every time it was called giving how many words were marked and how many were collected and the size of list space, etc. During a previous rehearsal, the garbage collector hadn't been called, but we had not refreshed the LISP core image, so we ran out of free storage during the demonstration.
Nothing had ever been said about a garbage collector, and I could only imagine the reaction of the audience. We were already behind time on a tight schedule, it was clear that typing out the garbage collector message would take all the remaining time allocated to the demonstration, and both the lecturer and the audience were incapacitated by laughter. I think some of them thought we were victims of a practical joker.
John McCarthy Artificial Intelligence Laboratory Computer Science Department Stanford University Stanford, California 94305
This draft of LISP[F77,JMC] PUBbed at time on date.