9 Bibliography

THE REAL MEANING OF A BIBLIOGRAPHY:

" ... most papers in computer science describe how their authors learned what someone else already knew." P. J. Landin

Abelson, Harold and Gerald Sussman; 1985, Structure and Interpretation of Computer Programs, MIT Press, Cambridge, Mass.

Allen, John; 1978, Anatomy of LISP, McGraw-Hill, New York.

Backus, John; 1978, Can programming be liberated from the VonNeumann style? a functional style and its algebra of programs, Communications of the ACM, v.2t, n.8, p.613-641, Association of Computing Machinery, New York.

Barendregt, Henk; 1977, The type{ree lambda calculus, Handbook of Mathe­matical Logic, Jon Barwise (editor), North-Holland, Amsterdam.

Bledsoe, W.W. and D.W. Loveland; 1984, Theorem proving: the last 25 years, American Mathematical Society, Providence, R.I.

Borges, Jorge Luis; 1962, Labyrinths, Selected Stories and Other Writings, New Directions, San Francisco.

Brooks, Rodney and Richard Gabriel; 1984, A Critique of Common LISP, Record of the 1984 ACM Symposium on LISP and Functional Program­ming, Austin.

Cartwright, R. and John McCarthy; 1978, Representations of recursive pro­grams infirst-orderlogic, Proc. In1'n. Conf. on Math. Studies ofInf. Proc., Kyoto.

Chang, Chin-Liang and Richard Char-Thng Lee; 1973, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York.

Chatin, Gregory; 1988, Algorithmic Information Theory, Cambridge University Press, Cambridge.

W. R. Stark, LISP, Lore, and Logic© Springer-Verlag New York, Inc. 1990

9. Bibliography 241

Church, Alonzo; 1941, The calculi of lambda-conversion, Annals of Mathe­matical Studies, v.6, Princeton University, Princeton, NJ ..

Clarke, T., P. Gladstone, C. MacLean, and A. Norman; 1980, SKIM-the S, K, I, Reduction Machine, Record of the 1980 LISP Conference, Stanford University and Santa Clara University, Palo Alto, Calif.

Clocks in, J.H. and C.S. Mellish; 1984, Programming in PROLOG. second edition, Springer, Berlin.

Conway, J.H.; 1972, Unpredictable iterations. Proc. 1972 Number Theory Con­ference, University of Colorado, Boulder.

Cook, Stephen; 1971, The complexity of theorem-proving procedures. Third ACM Symposium on the Theory of Computing, Association of Computing Machinery.

Curry, Haskel n.; 1978, Some philosophical aspects of combinatory logic. Pro­ceedings of The Kleene Symposium, Barwise, Keisler and Kunen (editors), North-Holland, Amsterdam.

Davis, Martin; 1958, Computability and Unsolvability. McGraw-Hill, New York.

Denning, Peter J.; 1989, The Internet worm. American Scientist, v.77, pp.126-128, March-April.

Dijkstra, E.; 1978, On-the-fly garbage collection. Communications of the ACM, Association of Computing Machinery, New York.

Dyson, Freeman; 1988, Infinite in All Directions, Harper and Row, New York.

Evans, A.; 1972, The lambda calculus and its relation to programming lan­guages. Proc. ACM Annual Conf., Association of Computing Machinery, New York.

Friedman, Daniel and Matthias FeUeisen; 1987, The Little LlSPer, trade edi­tion, MIT Press, Cambridge, Mass.

Gabriel, Richard; 1987, Memory management in LISP, AI Expert (magazine), February. 1985 Performance and Evaluation of LISP Systems. MIT Press, Cam­bridge, Mass.

Gabriel, Richard and Gerald Sussman; 1978, The Art of the Interpreter. AI memo #453, AI Laboratory, MIT Press, Cambridge, Mass.

Glasner, H., C. Hankin, and D. Till; 1984, Principles of Functional Program­ming. Prentice-Hall, London.

Golden HHI Computers, Inc.; 1984, Golden Common LISP Reference Manual. Golden Hill Computers, Cambridge, Mass.

242 9. Bibliography

Hare) David; 1987, Algorithmics: The Spirit of Computing, Addison-Wesley, Reading, Mass.

Henderson, Peter; 1980, Functional Programming Applications and Implemen­tation, Prentice-Hall, Englewood Cliffs, NJ.

Hofstadter, David; 1980, Godel, Escher, Bach: An Eternal Golden Braid, Vin­tage Books, New York.

Hopcroft, John and Jeffry Ullman; 1979, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass.

Keene, Sonya E.; 1989, Object-Oriented Programming in Common LISP: A Programmer's Guide to CLOS, Addison-Wesley, Reading, Mass.

Kessler, Robert R.; 1988, LISP: Objects, and Symbolic Programming, Scott, Foresman and Company, Glenview, lllinois.

Kleene, Stephen Cole; 1950, Introduction to Metamathematics, D. VanNos­trand, Princeton, N.J. --1967, Mathematical Logic, John Wiley, New York.

Knuth, Donald; 1973, The Art of Computer Programming, volumes 1, 2, and 3, Addison-Wesley, Reading, Mass. --1976, Mathematics and computer science: coping withftniteness, Sci­ence, v.194, n.4271, December.

Kolata, Gina; 1982, How can computers get common sense?, Science, v.217, September. --1982, Does Godel's theorem really matter to mathematics?, Science, v.218, November.

Kurzweil, Raymond; 1985, What is artificial intelligence anyway?, The Amer­ican Scientist, v.73.

Lagarias, Jeffrey; 1985, The 3x+ I problem and its generalizations, American Math. Monthly, v.92, n.1.

Landin, Peter; 1965,A correspondence betweenALGOL-60 and Church's lambda calculus, Communications of the ACM, v.8. --1966, The next 700 programming languages, Communications of the ACM, v.9, n.3.

Machtey, Michael and Paul Young; 1978, An Introduction to the General Theory of Algorithms, North-Holland, Amsterdam.

Manna, Zohar and Jean Vuillemin; 1972, Fixedpoint approach to the theory of computation, Communications of the ACM, v.15, n.7.

Marshall, E; 1988, The worm's aftermath, Science v.242, pp.1l21-1l22.

9. Bibliography 243

McCarthy, John; 1959, Programs with common sense, Proc. Symp. on Mech­anization of Thought Processes, Teddington, England, National Physical Laboratory. --1960, The LISP Programmer's Manual, MIT Computing Center, Cam­bridge, Mass. --1960, Recursive functions of symbolic expressions and their compu­tation by machine, part I; Communications of the ACM; v.3, n.4. --1962, Time sharing, Management and the Computer of the Future, MIT Press, Cambridge, Mass., pp.220-236. --1962, Computer programs for checking mathematical proofs, in AMS Proc. of Symp. in Pure Mathematics, v.5, American Mathematical Society, Providence, R.I. --1963, A basis for the mathematical theory of computation, Com­puter Programming and Formal Systems, Braffort and Hirschberg (edi­tors), Studies in Logic Series, North-Holland, Amsterdam. --1968, Programs with common sense, Semantic Information Process­ing, Marvin Minsky (editor). --1978, A micromanualfor LlSP-not the whole truth, ACM SIGPLAN Notices, v.l3, n.8, Association of Computing Machinery, New York. --1981, History of LISP, History of Programming Languages, Richard Wexelblat (editor), Academic Press, New York. --1987, Generality in artificial intelligence, 1971 Turing Award lecture, pp.257-267, in A.C.M. Turing Award Lectures, ACM Press, Addison­Wesley, Reading, Mass. CACM.

McCarthy, John and Claude Shannon; 1956, Automata Studies, Princeton University Press, Princeton, N.J.

McCarthy, John and Carolyn Talcott; 1980, LISP: Programming and Proving, Computer Science Department, Stanford University, Palo Alto, Calif.

McCarthy, John, Paul Abrahams, Daniel Edwards, Timothy Hart, and Michael Levin; 1965, LISP 1.5 Programmer's Manual, MIT Press, Cam­bridge, Mass.

Mendelson, Elliot; 1979, Introduction to Mathematical Logic, VanNostrand, New York.

Moon, David; 1974, MACLISP Reference Manual, MIT Press, Cambridge, Mass.

Moses, Joel; 1970, The function of FUNCTlON in LISP, or why the funarg prob­lem should be called the environment problem, ACM SIGSAM Bulletin, v.15, Association of Computing Machinery, New York.

Newell, A., J.C. Shaw, and H.A. Simon; 1957, Empirical Explorations of the Logic Theory Machine, Report P-951, RAND Corporation, Santa Monica, Calif.

244 9. Bibliography

Pavelle, Richard, Michael Rothstein, and John Fitch; 1981, Computer alge­bra, Scientific American, v.245, n.6.

Pitman, Kent; 1981, The Revised MacLlSP Manual, TR295 , Laboratory for Computer Science, MIT Press, Cambridge, Mass.

Pratt, Vaughn; 1979, A mathematician's view of LISP, Byte, v.4, n.8.

Pump lin, Bruce; 1987, Compiling LISP procedures, AI Expert (magazine), February 1987.

Revesz, G.E.; 1988, Lambda-Calculus, Combinators, and Functional Program­ming, Cambridge University Press, Cambridge, Great Britain.

Robinson, J.A., 1965, A machine-oriented logic based on the resolution princi­pal, Journal of the ACM, p. 23-41, v.12, n.l, Association for Computing Machinery, New York.

Rogers, Hartley; 1967, Theory of Recursive Functions and Effective Computabil­ity, McGraw-Hill, New York.

Saint-James, Emmanual; 1984, Recursion is more efficient than iteration. Re­cord of the 1984 ACM Symposium on LISP and Functional Computing, Austin, Association of Computing Machinery, New York.

Shannon, Claude E.; 1956, A universal Turing machine with two internal states, Automata Studies, Annals of Mathematical Studies XXXIV, Princeton University Press, Princeton, N.J.

Shoch, J.F. and J.A. Hupp; 1982, The worm programs--early experiences with a distributed computation, CACM, v.25, pp.172-180.

Stark, Richard and Leon Kolin; 1989, The social metaphor in distributed computing, Journal of Parallel and Distributed Computing, v.6, Academic Press.

Steele, Guy; 1980, The dream of a lifetime: a lazy variable extent mechanism, Record of the 1980 LISP Conference, Association of Computing Machin­ery, New York. --1984, Common LISP Reference Manual, Digital Press, Bradford, Mass. --1985, Performance and Evaluation of LISP Systems, MIT Press, Cam-bridge, Mass.

Steele, Guy and Gerald Sussman; 1978, The Art of the Interpreter, AI Memo 453, MIT AI Lab, Cambridge, Mass.

Stroyan, Herbert; 1984, The early history of LISP (1956-59), Record of the 1984 ACM Symposium on LISP and Functional Programming, Associa­tion for Computing Machinery, New York.

Smullian, Raymond; 1985, To Mock a Mockingbird, Alfred A. Knopf, New York.

9. Bibliography 245

Sussman, Gerald and Guy Steele; 1975, Scheme: an Interpreter for the Ex­tended Lambda Calculus, memo-349, Artificial Intelligence Laboratory, MIT Press, Cambridge, Mass.

Teiteiman, Warren; 1978, InterLISP Reference Manual, Xerox, Palo Alto, Calif.

Thompson, Ken; 1984, Reflections on trusting trust, a Turing Award Lecture, Communications of the ACM, p.761-763, v.27, n.8.

Touretzky, David; 1984, A Gentle Introduction to Symbolic Computation, Harper and Row, New York.

VanHeijenoort, Jean (editor); 1967, From Frege to Godel: A Source Book in Mathematical Logic, 1879-1931, Harvard University, Cambridge, Mass.

VonNeumann, Jobn; 1966, Theory of self-reproducing automata, Collected Works of John VonNeumann, A.W. Burkes (editor), University of Illinois Press, Urbana.

Wagon, Stan; 1985, The collatz problem, The Mathematical Intelligencer, v.7, Springer-Verlag, New York.

Waldrop, Mitchell; 1984, The intelligence of organizations, Science, v.225, September.

Wand, Mitchell; 1984, What is LISP? American Mathematical Monthly, v.91, n.l, January, 1984.

Wang, Hao; 1960, Toward mechanical mathematics. IBM Journal, January. --1963, Mechanical mathematics and inferential analysis. Computer Programming and Formal Systems, Braffort and Hirschberg (editors), Stud­ies in Logic Series, North-Holland, Amsterdam.

Weinreb, Daniel and David Moon; 1981, LISP Machine Manual. Artificial Intelligence Laboratory, MIT Press, Cambridge, Mass.

Weissman, Clark; 1967, LISP 1.5 Primer, Dickenson, Belmont, California.

Wilensky, Robert; 1986, Common LISPcraft, Norton, New York.

Winston, Patrick; 1984, Artificial Intelligence . Addison-Wesley, Reading, Mass.

Winston, Patrick and Berthold Horn; 1988, LISP, Addison-Wesley, Reading, Mass.