In Proceedings of the ACM Symposium on Lisp and Functional Programming, pp. 226-234.

Clinger, William, and Jonathan Rees. 1991. Macros that work. In Proceedings of the 1991 ACM Conference on Principles of Programming Languages, pp. 155-162.

Colmerauer A., H. Kanoui, R. Pasero, and P. Roussel. 1973. Un systeme de communication homme-machine en francais. Technical report, Groupe Intelligence Artificielle, Universite dAix Marseille, Luminy.

Cormen, Thomas, Charles Leiserson, and Ronald Rivest. 1990. Introduction to Algorithms. Cambridge, MA: MIT Press. (Русский перевод: Кормен Т., Ч. Лей-зерсон, Р. Ривест. Алгоритмы: построение и анализ. - М.: МЦНМО, 2001.)

Darlington, John, Peter Henderson, and David Turner. 1982. Functional Programming 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. In Programming Languages, edited by F. Genuys. New York: Academic Press, pp. 43-112. (Русский перевод: Дийкстра Э. Взаимодействие последовательных процессов. в кн.: Языки программирования, под ред. Ф. Женюи. - М.: Мир, 1972, с. 9-86.)

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 the ACM 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 Fifth Generation Project: Introduction, survey, and evaluation. In Future Generation Computer Systems, vol. 9, pp. 105-117.

Feeley, Marc. 1986. Deux approches a limplantation du language Scheme. Masters thesis, Universite de Montreal.

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 Its Applications, volume 1. New York: John Wiley & Sons. (Русский перевод: Феллер В. Введение в теорию вероятностей и её приложения, в 2-х томах. - М.: Мир, 1984)

Fenichel, R., and J. Yochelson. 1969. A Lisp garbage collector for virtual memory 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 Problem Solvers. Cam-

bridge, MA: MIT Press.

Friedman, Daniel P., and David S. Wise. 1976. CONS should not evaluate its arguments. In Automata, Languages, and Programming: Third International 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: MIT Press/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 and Its 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 and Models. San Mateo, CA: Morgan-Kaufman.

Green, Cordell. 1969. Application of theorem proving to problem solving. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 219240.

Green, Cordell, and Bertram Raphael. 1968. The use of theorem-proving techniques in question-answering systems. In Proceedings of the ACM National Conference,

pp. 169-181.

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

Guttag, John V. 1977. Abstract data types and the development of data structures.

Communications of the ACM 20(6):397-404.

Hamming, Richard W. 1980. Coding and Information Theory. Englewood Cliffs,

N.J.: Prentice-Hall.

Hanson, Christopher P. 1990. Efficient stack allocation for tail-recursive languages. In Proceedings of ACM Conference on Lisp and Functional Programming, pp.

106-118.

Hanson, Christopher P. 1991. A syntactic closures macro facility. Lisp Pointers,

4(3).

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

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

Havender, J. 1968. Avoiding deadlocks in multi-tasking systems. IBM Systems

Journal 7(2):74-84.

Hearn, Anthony C. 1969. Standard Lisp. Technical report AIM-90, Artificial Intel-

ligence Project, Stanford University.

Henderson, Peter. 1980. Functional Programming: Application and Implementation. Englewood Cliffs, N.J.: Prentice-Hall. (Русский перевод: П. Хендерсон. Функциональное программирование. - М.: Мир, 1983.)

Henderson. Peter. 1982. Functional Geometry. In Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pp. 179-187.

Hewitt, Carl E. 1969. PLANNER: A language for proving theorems in robots. In Proceedings of the International Joint Conference on Artificial Intelligence, pp.

295-301.

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

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

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

Hofstadter, Douglas R. 1979. Godel, Escher, Bach: An Eternal Golden Braid. New York: Basic Books. (Русский перевод: Хофштадтер Д. Гёдель, Эшер, Бах: эта бесконечная гирлянда. - Самара: Бахрах, 2001.)

Hughes, R. J. M. 1990. Why functional programming matters. In Research Topics in Functional Programming, edited by David Turner. Reading, MA: Addison-

Wesley, pp. 17-42.

IEEE Std 1178-1990. 1990. IEEE Standard for the Scheme Programming Language.

Ingerman, Peter, Edgar Irons, Kirk Sattley, and Wallace Feurzeig; assisted by M. Lind, Herbert Kanner, and Robert Floyd. 1960. THUNKS: A way of compiling procedure statements, with some comments on procedure declarations. Неопубликованная рукопись. (А также частное сообщение от Уоллеса Ферцейга.)

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

Kohlbecker, Eugene Edmund, Jr. 1986. Syntactic extensions in the programming language Lisp. Ph.D. thesis, Indiana University.

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

Knuth, Donald E. 1973. Fundamental Algorithms. Volume 1 of The Art of Computer Programming. 2nd edition. Reading, MA: Addison-Wesley. (Русский перевод: Кнут Д. Искусство программирования для ЭВМ. Т. 1.: Основные алгоритмы. -

СПб.: Вильямс, 2000.)

Knuth, Donald E. 1981. Seminumerical Algorithms. Volume 2 of The Art of Computer Programming. 2nd edition. Reading, MA: Addison-Wesley. (Русский