[1] CHURCH, A.,The Calculi of Lambda-Conversion, Annals of Mathematics Studies, no. 6, Princeton, 1941, Princeton University Press.[2] -,

Introduction to Mathematical Logic, Princeton, 1952, Princeton University Press.[3] DAVIS, M.,

Computability and Unsolvability, New York, 1958, McGraw-Hill.[4] ERSHOV, A. P.,

On Operator Algorithms(Russian), Doklady Akademii Nauk, vol 122, no. 6, pp. 967-970.[5] KLEENE, S.C.,

Recursive Predicates and Quantifiers, Transactions of the American Mathematical Society, vol. 53, 1953, p. 41.[6] MCCARTHY, J., letter to the editor, Communications of the Association for Computing Machinery, vol. 2, August, 1959, p. 2.

[7] -,

Recursive Functions of Symbolic Expressions and Their Computation byMachine, Part I, Communications Of the ACM, vol. 3, April, 1960, pp. 184-195.[8] -,

The LISP Programmer's Manual, M.I.T. Computation Center, 1960.[9] -,

Computer Programs for Checking Mathematical Proofs, to be published in the Proceedings of the American Mathematical Society's Symposium on Recursive Function Theory, held in New York, April, 1961.[10] -,

Programs With Common Sense, Proceedings of the Teddington Conference on the Mechanization of Thought Processes, H. M. Stationery Office, 1960.[11] MARKOV, A.A.,

Theory of Algorithms(Russian), Moscow, 1954, USSR Academy of Sciences, Steklov Mathematical Institute.[12] NAUR, P., et al.,

Report on the Algorithmic Language ALGOL 60, Communications of the ACM, vol. 3, May 1960.[13] TURING, A.M.,

On Computable Numbers with an Application to the

Entscheidungs Problem, Proceedings of the London Mathematical Society, ser. 2, vol. 43, 1937, p. 230; correction, ibid, vol. 43, 1937, p. 544.[14] YANOV, Y.I.,

The Logical Schemes of Algorithms, from Problems of Cybernetics I, translated from the Russian by Nadler, Griffiths, Kiss, and Muir, New York, 1960, Pergamon Press Ltd., pp. 82-140.

Wed May 1 20:03:21 PDT 1996