Structure and Interpretation of Computer Programs

McAllester, David Allen. 1980. An outlook on truth maintenance. Memo 551, MIT Artificial

Intelligence Laboratory.

McCarthy, John. 1960. Recursive functions of symbolic expressions and their computation by

machine. Communications of the ACM 3(4):184-195.

McCarthy, John. 1967. A basis for a mathematical theory of computation. In Computer Programing

and Formal Systems, edited by P. Braffort and D. Hirschberg. North-Holland.

McCarthy, John. 1978. The history of Lisp. In Proceedings of the ACM SIGPLAN Conference on the

History of Programming Languages.

McCarthy, John, P. W. Abrahams, D. J. Edwards, T. P. Hart, and M. I. Levin. 1965. Lisp 1.5

Programmer’s Manual. 2nd edition. Cambridge, MA: MIT Press.

McDermott, Drew, and Gerald Jay Sussman. 1972. Conniver reference manual. Memo 259, MIT

Artificial Intelligence Laboratory.

Miller, Gary L. 1976. Riemann’s Hypothesis and tests for primality. Journal of Computer and System 

Sciences 13(3):300-317.

Miller, James S., and Guillermo J. Rozas. 1994. Garbage collection is fast, but a stack is faster. Memo

1462, MIT Artificial Intelligence Laboratory.

Moon, David. 1978. MacLisp reference manual, Version 0. Technical report, MIT Laboratory for

Computer Science.

Moon, David, and Daniel Weinreb. 1981. Lisp machine manual. Technical report, MIT Artificial

Intelligence Laboratory.

Morris, J. H., Eric Schmidt, and Philip Wadler. 1980. Experience with an applicative string processing

language. In Proceedings of the 7th Annual ACM SIGACT/SIGPLAN Symposium on the Principles of

Programming Languages.

Phillips, Hubert. 1934. The Sphinx Problem Book. London: Faber and Faber.

Pitman, Kent. 1983. The revised MacLisp Manual (Saturday evening edition). Technical report 295,

MIT Laboratory for Computer Science.

Rabin, Michael O. 1980. Probabilistic algorithm for testing primality. Journal of Number Theory 

12:128-138.

Raymond, Eric. 1993. The New Hacker’s Dictionary. 2nd edition. Cambridge, MA: MIT Press.

Raynal, Michel. 1986. Algorithms for Mutual Exclusion. Cambridge, MA: MIT Press.

Rees, Jonathan A., and Norman I. Adams IV. 1982. T: A dialect of Lisp or, lambda: The ultimate

software tool. In Conference Record of the 1982 ACM Symposium on Lisp and Functional 

Programming, pp. 114-122.

Rees, Jonathan, and William Clinger (eds). 1991. The revised

4

 report on the algorithmic language

Scheme. Lisp Pointers, 4(3).

---

Rivest, Ronald, Adi Shamir, and Leonard Adleman. 1977. A method for obtaining digital signatures

and public-key cryptosystems. Technical memo LCS/TM82, MIT Laboratory for Computer Science.

Robinson, J. A. 1965. A machine-oriented logic based on the resolution principle. Journal of the ACM 

12(1):23.

Robinson, J. A. 1983. Logic programming -- Past, present, and future. New Generation Computing 

1:107-124.

Spafford, Eugene H. 1989. The Internet Worm: Crisis and aftermath. Communications of the ACM 

32(6):678-688.

Steele, Guy Lewis, Jr. 1977. Debunking the ‘‘expensive procedure call’’ myth. In Proceedings of the

National Conference of the ACM, pp. 153-62.

Steele, Guy Lewis, Jr. 1982. An overview of Common Lisp. In Proceedings of the ACM Symposium

on Lisp and Functional Programming, pp. 98-107.

Steele, Guy Lewis, Jr. 1990. Common Lisp: The Language. 2nd edition. Digital Press.

Steele, Guy Lewis, Jr., and Gerald Jay Sussman. 1975. Scheme: An interpreter for the extended

lambda calculus. Memo 349, MIT Artificial Intelligence Laboratory.

Steele, Guy Lewis, Jr., Donald R. Woods, Raphael A. Finkel, Mark R. Crispin, Richard M. Stallman,

and Geoffrey S. Goodfellow. 1983. The Hacker’s Dictionary. New York: Harper & Row.

Stoy, Joseph E. 1977. Denotational Semantics. Cambridge, MA: MIT Press.

Sussman, Gerald Jay, and Richard M. Stallman. 1975. Heuristic techniques in computer-aided circuit

analysis. IEEE Transactions on Circuits and Systems CAS-22(11):857-865.

Sussman, Gerald Jay, and Guy Lewis Steele Jr. 1980. Constraints -- A language for expressing

almost-hierachical descriptions. AI Journal 14:1-39.

Sussman, Gerald Jay, and Jack Wisdom. 1992. Chaotic evolution of the solar system. Science 

257:256-262.

Sussman, Gerald Jay, Terry Winograd, and Eugene Charniak. 1971. Microplanner reference manual.

Memo 203A, MIT Artificial Intelligence Laboratory.

Sutherland, Ivan E. 1963. SKETCHPAD: A man-machine graphical communication system. Technical

report 296, MIT Lincoln Laboratory.

Teitelman, Warren. 1974. Interlisp reference manual. Technical report, Xerox Palo Alto Research 

Center.

Thatcher, James W., Eric G. Wagner, and Jesse B. Wright. 1978. Data type specification:

Parameterization and the power of specification techniques. In Conference Record of the Tenth Annual

ACM Symposium on Theory of Computing, pp. 119-132. Turner, David. 1981. The future of

applicative languages. In Proceedings of the 3rd European Conference on Informatics, Lecture Notes

in Computer Science, volume 123. New York: Springer-Verlag, pp. 334-348.

---

Wand, Mitchell. 1980. Continuation-based program transformation strategies. Journal of the ACM 

27(1):164-180.

Waters, Richard C. 1979. A method for analyzing loop programs. IEEE Transactions on Software 

Engineering 5(3):237-247.

Winograd, Terry. 1971. Procedures as a representation for data in a computer program for

understanding natural language. Technical report AI TR-17, MIT Artificial Intelligence Laboratory.

Winston, Patrick. 1992. Artificial Intelligence. 3rd edition. Reading, MA: Addison-Wesley.

Zabih, Ramin, David McAllester, and David Chapman. 1987. Non-deterministic Lisp with

dependency-directed backtracking. AAAI-87, pp. 59-64.

Zippel, Richard. 1979. Probabilistic algorithms for sparse polynomials. Ph.D. dissertation, Department

of Electrical Engineering and Computer Science, MIT.

Zippel, Richard. 1993. Effective Polynomial Computation. Boston, MA: Kluwer Academic Publishers.

[Go to first, previous, next page;   contents;   index]

---