Skip to main content
SpringerLink
Log in

Bibliography

  • Chapter
LISP, Lore, and Logic

  • 317 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

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

    Google Scholar 

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

    MATH  Google Scholar 

  • Backus, John 1978, Can programming be liberated from the VûnNeumann style? a functional style and its algebra of programs, Communications of the ACM, v.21, n.8, p.613–641, Association of Computing Machinery, New York.

    Google Scholar 

  • Barendregt, Henk 1977, The type-free lambda calculus, Handbook of Mathematical Logic, Jon Barwise (editor), North-Holland, Amsterdam.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Brooks, Rodney and Richard Gabriel 1984, A Critique of Common LISP, Record of the 1984 ACM Symposium on LISP and Functional Programming, Austin.

    Google Scholar 

  • Cartwright, R. and John McCarthy 1978, Representations of recursive programs in first-order logic, Proc. Int’n. Conf. on Math. Studies of Inf. Proc, Kyoto.

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  • Church, Alonzo 1941, The calculi of lambda-conversion, Annals of Mathematical Studies, v.6, Princeton University, Princeton, N.J..

    Google Scholar 

  • 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.

    Google Scholar 

  • Clocksin, J.H. and CS. Melllsh 1984, Programming in Prolog, second edition, Springer, Berlin.

    Google Scholar 

  • Conway, J.H. 1972, Unpredictable iterations, Proc. 1972 Number Theory Conference, University of Colorado, Boulder.

    Google Scholar 

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

    Google Scholar 

  • Curry, Haskel B. 1978, Some philosophical aspects of combinatory logic, Proceedings of The Kleene Symposium, Barwise, Keisler and Kunen (editors), North-Holland, Amsterdam.

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Evans, A. 1972, The lambda calculus and its relation to programming languages, Proc. ACM Annual Conf., Association of Computing Machinery, New York.

    Google Scholar 

  • Friedman, Daniel and Matthias Felleisen 1987, The Little Lisper, trade edition, MIT Press, Cambridge, Mass.

    Google Scholar 

  • Gabriel, Richard 1987, Memory management in LISP, AI Expert (magazine), February.

    Google Scholar 

  • Gabriel, Richard 1985 Performance and Evaluation of LISP Systems, MIT Press, Cambridge, Mass.

    Google Scholar 

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

    Google Scholar 

  • Glasner, H., C. Hankin, and D. Till 1984, Principles of Functional Programming, Prentice-Hall, London.

    Google Scholar 

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

    Google Scholar 

  • Harel David 1987, Algorithmes: The Spirit of Computing, Addison-Wesley, Reading, Mass.

    Google Scholar 

  • Henderson, Peter 1980, Functional Programming Applications and Implementation, Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Hofstadter, David 1980, Gödel, Escher, Bach: An Eternal Golden Braid, Vintage Books, New York.

    Google Scholar 

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

    MATH  Google Scholar 

  • Keene, Sonya E 1989, Object-Oriented Programming in Common LISP: A Programmer’s Guide to Clos, Addison-Wesley, Reading, Mass.

    MATH  Google Scholar 

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

    Google Scholar 

  • Kleene, Stephen Cole 1950, Introduction to Metamathematics, D. VanNos-trand, Princeton, N.J.

    Google Scholar 

  • Kleene, Stephen Cole 1967, Mathematical Logic, John Wiley, New York.

    MATH  Google Scholar 

  • Knuth, Donald 1973, The Art of Computer Programming, volumes 1, 2, and 3, Addison-Wesley, Reading, Mass.

    Google Scholar 

  • Knuth, Donald1976, Mathematics and computer science: coping withfiniteness, Science, V.194, n.4271, December.

    Google Scholar 

  • Kolata, Gina 1982, How can computers get common sense?, Science, v.217, September.

    Google Scholar 

  • Kolata, Gina1982, Does GödeVs theorem really matter to mathematics?, Science, v.218, November.

    Google Scholar 

  • Kurzweil, Raymondc 1985, What is artificial intelligence anyway?, The American Scientist, v.73.

    Google Scholar 

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

    Google Scholar 

  • Landin, Peter; 1965, A correspondence between ALGOL-60 and Church’s lambda calculus, Communications of the ACM, v.8.

    Google Scholar 

  • Landin, Peter; 1966, The next 700 programming languages, Communications of the ACM, v.9, n.3.

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  • Marshall, E; 1988, The worm’s aftermath, Science v.242, pp.1121–1122.

    Article  Google Scholar 

  • McCarthy, John; 1959, Programs with common sense, Proc. Symp. on Mechanization of Thought Processes, Teddington, England, National Physical Laboratory.

    Google Scholar 

  • McCarthy, John; 1960, The LISP Programmer’s Manual, MIT Computing Center, Cambridge, Mass.

    Google Scholar 

  • McCarthy, John; 1960, Recursive functions of symbolic expressions and their computation by machine, part I; Communications of the ACM; v.3, n.4.

    Google Scholar 

  • McCarthy, John;1962, Time sharing, Management and the Computer of the Future, MIT Press, Cambridge, Mass., pp.220–236.

    Google Scholar 

  • McCarthy, John; 1962, Computer programs for checking mathematical proofs, in AMS Proc. of Symp. in Pure Mathematics, v.5, American Mathematical Society, Providence, R.I.

    Google Scholar 

  • McCarthy, John; 1963, A basis for the mathematical theory of computation, Computer Programming and Formal Systems, Braffort and Hirschberg (editors), Studies in Logic Series, North-Holland, Amsterdam.

    Google Scholar 

  • McCarthy, John; 1968, Programs with common sense, Semantic Information Processing, Marvin Minsky (editor).

    Google Scholar 

  • McCarthy, John; 1978, A micromanualfor LISP—not the whole truth, ACM Sigplan Notices, v.13, n.8, Association of Computing Machinery, New York.

    Google Scholar 

  • McCarthy, John; 1981, History of LISP, History of Programming Languages, Richard Wexelblat (editor), Academic Press, New York.

    Google Scholar 

  • McCarthy, John; 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.

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  • McCarthy, John, Paul Abrahams, Daniel Edwards, Timothy Hart, and Michael Levin; 1965, LISP 1.5 Programmer’s Manual, MIT Press, Cambridge, Mass.

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  • Moses, Joel; 1970, The function of Function in LISP, or why the funarg problem should be called the environment problem, ACM Sigsam Bulletin, v.15, Association of Computing Machinery, New York.

    Google Scholar 

  • 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.

    Google Scholar 

  • Paveile, Richard, Michael Rothstein, and John Fitch; 1981, Computer algebra, Scientific American, v.245, n.6.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Pumplin, Bruce; 1987, Compiling LISP procedures, AI Expert (magazine), February 1987.

    Google Scholar 

  • Revesz, G.E.; 1988, Lambda-Calculus, Combinators, and Functional Programming, Cambridge University Press, Cambridge, Great Britain.

    MATH  Google Scholar 

  • Robinson, J.A., 1965, A machine-oriented logic based on the resolution principal, Journal of the ACM, p. 23–41, v.12, n.1, Association for Computing Machinery, New York.

    Article  MATH  Google Scholar 

  • Rogers, Hartley; 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.

    MATH  Google Scholar 

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

    Google Scholar 

  • Kleene, Stephen Cole; 1956, A universal Turing machine with two internal states, Automata Studies, Annals of Mathematical Studies XXXIV, Princeton University Press, Princeton, N.J.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Steele, Guy; 1980, The dream of a lifetime: a lazy variable extent mechanism, Record of the 1980 LISP Conference, Association of Computing Machinery, New York.

    Google Scholar 

  • Steele, Guy; 1984, Common LISP Reference Manual, Digital Press, Bradford, Mass.

    Google Scholar 

  • Steele, Guy; 1985, Performance and Evaluation of LISP Systems, MIT Press, Cambridge, Mass.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  • VanHeijenoort, Jean(editor); 1967, From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931, Harvard University, Cambridge, Mass.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Wang, Hao; 1960, Toward mechanical mathematics, IBM Journal, January.

    Google Scholar 

  • Wang, Hao;1963, Mechanical mathematics and inferential analysis, Computer Programming and Formal Systems, Braffort and Hirschberg (editors), Studies in Logic Series, North-Holland, Amsterdam.

    Google Scholar 

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

    Google Scholar 

  • Weissman, Clark; 1967, LISP 15 Primer, Dickenson, Belmont, California.

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of South Florida, Tampa, Florida, 33620, USA

    W. Richard Stark

Authors
  1. W. Richard Stark
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Stark, W.R. (1990). Bibliography. In: LISP, Lore, and Logic. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8931-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-8931-6_9

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97072-1

  • Online ISBN: 978-1-4613-8931-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation