参考文献

Abelson, Harold, Andrew Berlin, Jacob Katzenelson, William McAllister,Guillermo Rozas, Gerald Jay Sussman, and Jack Wisdom. 1992. The SupercomputerToolkit: A general framework for special-purpose computing.International Journal of High-Speed Electronics 3(3): 337-361.–›

Allen, John. 1978. Anatomy of Lisp. New York: McGraw-Hill.

ANSI X3.226-1994. American National Standard for InformationSystems---Programming Language---Common Lisp.

Appel, Andrew W. 1987. Garbage collection can be faster than stackallocation. Information Processing Letters 25(4): 275-279.–›

Backus, John. 1978. Can programming be liberated from the von Neumann style?Communications of the ACM 21(8): 613-641.–›

Baker, Henry G., Jr. 1978. List processing in real time on a serial computer.Communications of the ACM 21(4): 280-293.–›

Batali, John, Neil Mayle, Howard Shrobe, Gerald Jay Sussman, and Daniel Weise.1982. The Scheme-81 architecture---System and chip. In Proceedings ofthe MIT Conference on Advanced Research in VLSI, edited byPaul Penfield, Jr. Dedham, MA: Artech House.

Borning, Alan. 1977. ThingLab---An object-oriented system for buildingsimulations using constraints. In Proceedings of the 5th InternationalJoint Conference on Artificial Intelligence.–›

Borodin, Alan, and Ian Munro. 1975. The Computational Complexity ofAlgebraic and Numeric Problems. New York: American Elsevier.

Chaitin, Gregory J. 1975. Randomness and mathematical proof.Scientific American 232(5): 47-52.–›

Church, Alonzo. 1941. The Calculi of Lambda-Conversion. Princeton,N.J.: Princeton University Press.

Clark, Keith L. 1978. Negation as failure. In Logic and Data Bases.New York: Plenum Press, pp. 293-322.–›

Clinger, William. 1982. Nondeterministic call by need is neither lazy nor byname. In Proceedings of the ACM Symposium on Lisp andFunctional Programming, pp. 226-234.

Clinger, William, and Jonathan Rees. 1991. Macros that work. InProceedings of the 1991 ACM Conference on Principles ofProgramming Languages, pp. 155-162.–›

Colmerauer A., H. Kanoui, R. Pasero, and P. Roussel. 1973. Un syst`eme decommunication homme-machine en fran\c{c}ais. Technical report, GroupeIntelligence Artificielle, Universit\'e d'Aix Marseille, Luminy.–›

Cormen, Thomas, Charles Leiserson, and Ronald Rivest. 1990. Introductionto Algorithms. Cambridge, MA: MIT Press.

Darlington, John, Peter Henderson, and David Turner. 1982. FunctionalProgramming and Its Applications. New York: Cambridge University Press.

Dijkstra, Edsger W. 1968a. The structure of the “THE”multiprogramming system. _Communications of the ACM_11(5): 341-346.–›

Dijkstra, Edsger W. 1968b. Cooperating sequential processes. InProgramming Languages, edited by F. Genuys. New York: Academic Press,pp. 43-112.–›

Dinesman, Howard P. 1968. Superior Mathematical Puzzles. New York:Simon and Schuster.

deKleer, Johan, Jon Doyle, Guy Steele, and Gerald J. Sussman. 1977.AMORD: Explicit control of reasoning. In Proceedings of theACM Symposium on Artificial Intelligence and Programming Languages,pp. 116-125.–›

Doyle, Jon. 1979. A truth maintenance system. _Artificial Intelligence_12: 231-272.–›

Feigenbaum, Edward, and Howard Shrobe. 1993. The Japanese National FifthGeneration Project: Introduction, survey, and evaluation. In FutureGeneration Computer Systems, vol. 9, pp. 105-117.–›

Feeley, Marc. 1986. Deux approches `a l'implantation du languageScheme. Masters thesis, Universit\'e de Montr\'eal.–›

Feeley, Marc and Guy Lapalme. 1987. Using closures for code generation.Journal of Computer Languages 12(1): 47-66.–›

Feller, William. 1957. An Introduction to Probability Theory and ItsApplications, volume 1. New York: John Wiley \& Sons.

Fenichel, R., and J. Yochelson. 1969. A Lisp garbage collector for virtualmemory computer systems. _Communications of the ACM_12(11): 611-612.–›

Floyd, Robert. 1967. Nondeterministic algorithms. JACM,14(4): 636-644.–›

Forbus, Kenneth D., and Johan deKleer. 1993. Building ProblemSolvers. Cambridge, MA: MIT Press.

Friedman, Daniel P., and David S. Wise. 1976. CONS should notevaluate its arguments. In Automata, Languages, and Programming: ThirdInternational Colloquium, edited by S. Michaelson and R. Milner, pp. 257-284.–›

Friedman, Daniel P., Mitchell Wand, and Christopher T. Haynes. 1992.Essentials of Programming Languages. Cambridge, MA: MITPress/ McGraw-Hill.

Gabriel, Richard P. 1988. The Why of Y. _Lisp Pointers_2(2): 15-25.–›

Goldberg, Adele, and David Robson. 1983. Smalltalk-80: The Language andIts Implementation. Reading, MA: Addison-Wesley.–›

Gordon, Michael, Robin Milner, and Christopher Wadsworth. 1979.Edinburgh LCF. Lecture Notes in Computer Science, volume 78. New York:Springer-Verlag.

Gray, Jim, and Andreas Reuter. 1993. Transaction Processing: Concepts andModels. San Mateo, CA: Morgan-Kaufman.

Green, Cordell. 1969. Application of theorem proving to problem solving. InProceedings of the International Joint Conference on ArtificialIntelligence, pp. 219-240.–›

Green, Cordell, and Bertram Raphael. 1968. The use of theorem-provingtechniques in question-answering systems. In Proceedings of theACM National Conference, pp. 169-181.–›

Griss, Martin L. 1981. Portable Standard Lisp, a brief overview. UtahSymbolic Computation Group Operating Note 58, University of Utah.

Guttag, John V. 1977. Abstract data types and the development of datastructures. Communications of the ACM 20(6): 396-404.–›

Hamming, Richard W. 1980. Coding and Information Theory. EnglewoodCliffs, N.J.: Prentice-Hall.

Hanson, Christopher P. 1990. Efficient stack allocation for tail-recur-sivelanguages. In Proceedings of ACM Conference on Lisp andFunctional Programming, pp. 106-118.–›

Hanson, Christopher P. 1991. A syntactic closures macro facility. LispPointers, 4(3).–›

Hardy, Godfrey H. 1921. Srinivasa Ramanujan. Proceedings of the LondonMathematical Society XIX(2).

Hardy, Godfrey H., and E. M. Wright. 1960. An Introduction to theTheory of Numbers. 4th edition. New York: Oxford University Press.–›

Havender, J. 1968. Avoiding deadlocks in multi-tasking systems. IBMSystems Journal 7(2): 74-84.

Hearn, Anthony C. 1969. Standard Lisp. Technical report AIM-90,Artificial Intelligence Project, Stanford University.–›

Henderson, Peter. 1980. Functional Programming: Application andImplementation. Englewood Cliffs, N.J.: Prentice-Hall.

Henderson, Peter. 1982. Functional Geometry. In Conference Record of the1982 ACM Symposium on Lisp and Functional Programming, pp. 179-187.–›,2002 version –›

Hewitt, Carl E. 1969. PLANNER: A language for provingtheorems in robots. In Proceedings of the International JointConference on Artificial Intelligence, pp. 295-301.–›

Hewitt, Carl E. 1977. Viewing control structures as patterns of passingmessages. Journal of Artificial Intelligence 8(3): 323-364.–›

Hoare, C. A. R. 1972. Proof of correctness of data representations.Acta Informatica 1(1).

Hodges, Andrew. 1983. Alan Turing: The Enigma. New York: Simon andSchuster.

Hofstadter, Douglas R. 1979. Gödel, Escher, Bach: An Eternal GoldenBraid. New York: Basic Books.

Hughes, R. J. M. 1990. Why functional programming matters. In ResearchTopics in Functional Programming, edited by David Turner. Reading, MA:Addison-Wesley, pp. 17-42.–›

IEEE Std 1178-1990. 1990. IEEE Standard for theScheme Programming Language.

Ingerman, Peter, Edgar Irons, Kirk Sattley, and Wallace Feurzeig; assisted byM. Lind, Herbert Kanner, and Robert Floyd. 1960. THUNKS: A way ofcompiling procedure statements, with some comments on procedure declarations.Unpublished manuscript. (Also, private communication from Wallace Feurzeig.)

Kaldewaij, Anne. 1990. Programming: The Derivation of Algorithms. NewYork: Prentice-Hall.

Knuth, Donald E. 1973. Fundamental Algorithms. Volume 1 of TheArt of Computer Programming. 2nd edition. Reading, MA: Addison-Wesley.

Knuth, Donald E. 1981. Seminumerical Algorithms. Volume 2 of TheArt of Computer Programming. 2nd edition. Reading, MA: Addison-Wesley.

Kohlbecker, Eugene Edmund, Jr. 1986. Syntactic extensions in the programminglanguage Lisp. Ph.D. thesis, Indiana University.–›

Konopasek, Milos, and Sundaresan Jayaraman. 1984. The TK!Solver Book: AGuide to Problem-Solving in Science, Engineering, Business, andEducation. Berkeley, CA: Osborne/McGraw-Hill.

Kowalski, Robert. 1973. Predicate logic as a programming language. Technicalreport 70, Department of Computational Logic, School of ArtificialIntelligence, University of Edinburgh.–›

Kowalski, Robert. 1979. Logic for Problem Solving. New York:North-Holland.–›

Lamport, Leslie. 1978. Time, clocks, and the ordering of events in adistributed system. Communications of the ACM 21(7): 558-565.–›

Lampson, Butler, J. J. Horning, R. London, J. G. Mitchell, and G. K. Popek.1981. Report on the programming language Euclid. Technical report, ComputerSystems Research Group, University of Toronto.–›

Landin, Peter. 1965. A correspondence between Algol 60 and Church's lambdanotation: Part I. Communications of the ACM 8(2): 89-101.

Lieberman, Henry, and Carl E. Hewitt. 1983. A real-time garbage collector basedon the lifetimes of objects. _Communications of the ACM_26(6): 419-429.–›

Liskov, Barbara H., and Stephen N. Zilles. 1975. Specification techniques fordata abstractions. _IEEE Transactions on Software Engineering_1(1): 7-19.–›

McAllester, David Allen. 1978. A three-valued truth-maintenance system. Memo473, MIT Artificial Intelligence Laboratory.–›

McAllester, David Allen. 1980. An outlook on truth maintenance. Memo 551,MIT Artificial Intelligence Laboratory.–›

McCarthy, John. 1960. Recursive functions of symbolic expressions and theircomputation by machine. _Communications of the ACM_3(4): 184-195.–›

McCarthy, John. 1963. A basis for a mathematical theory of computation. InComputer Programming and Formal Systems, edited by P. Braffort andD. Hirschberg. North-Holland.–›

McCarthy, John. 1978. The history of Lisp. In Proceedings of theACM SIGPLAN Conference on the History of ProgrammingLanguages.–›

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 IntelligenceLaboratory.–›

Moon, David. 1978. MacLisp reference manual, Version 0. Technical report,MIT Laboratory for Computer Science.–›

Moon, David, and Daniel Weinreb. 1981. Lisp machine manual. Technicalreport, MIT Artificial Intelligence Laboratory.–›

Morris, J. H., Eric Schmidt, and Philip Wadler. 1980. Experience with anapplicative string processing language. In Proceedings of the 7th AnnualACM SIGACT/SIGPLAN Symposium on the Principles ofProgramming Languages.

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

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 1982ACM Symposium on Lisp and Functional Programming, pp. 114-122.–›

Rees, Jonathan, and William Clinger (eds). 1991. The ( \rm revised^4 ) report on thealgorithmic language Scheme. Lisp Pointers, 4(3).–›

Rivest, Ronald, Adi Shamir, and Leonard Adleman. 1977. A method for obtainingdigital 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 resolutionprinciple. 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. InProceedings of the ACM Symposium on Lisp and FunctionalProgramming, 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 interpreterfor the extended lambda calculus. Memo 349, MIT ArtificialIntelligence Laboratory.–›

Steele, Guy Lewis, Jr., Donald R. Woods, Raphael A. Finkel, Mark R. Crispin,Richard M. Stallman, and Geoffrey S. Goodfellow. 1983. The Hacker'sDictionary. New York: Harper \& Row.–›

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

Sussman, Gerald Jay, and Richard M. Stallman. 1975. Heuristic techniques incomputer-aided circuit analysis. IEEE Transactions on Circuitsand Systems CAS-22(11): 857-865.–›

Sussman, Gerald Jay, and Guy Lewis Steele Jr. 1980. Constraints---A languagefor expressing almost-hierachical descriptions. AI Journal 14: 1-39.–›

Sussman, Gerald Jay, and Jack Wisdom. 1992. Chaotic evolution of the solarsystem. Science 257: 256-262.–›

Sussman, Gerald Jay, Terry Winograd, and Eugene Charniak. 1971. Microplannerreference manual. Memo 203A, MIT Artificial Intelligence Laboratory.–›

Sutherland, Ivan E. 1963. SKETCHPAD: A man-machine graphicalcommunication system. Technical report 296, MIT Lincoln Laboratory.–›

Teitelman, Warren. 1974. Interlisp reference manual. Technical report, XeroxPalo Alto Research Center.–›

Thatcher, James W., Eric G. Wagner, and Jesse B. Wright. 1978. Data typespecification: Parameterization and the power of specification techniques. InConference Record of the Tenth Annual ACM Symposium on Theoryof Computing, pp. 119-132.

Turner, David. 1981. The future of applicative languages. InProceedings of the 3rd European Conference on Informatics, Lecture Notesin 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 computerprogram 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-deterministicLisp 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.