1

Baumgart, B.G. Micro-Planner Alternote Reference Manual. Stanford AI Lab Operating Note No. 67, April 1972.

2

Daniel G. Bobrow, Requirements for advanced programming systems for list processing, Communications of the ACM, v.15 n.7, p.618-627, July 1972  [doi>10.1145/361454.361491]

3

Daniel G. Bobrow , Bertram Raphael, A comparison of list-processing computer languages: including a detailed comparison of COMIT, IPL-V, LISP 1.5, and SLIP, Communications of the ACM, v.7 n.4, p.231-240, April 1964  [doi>10.1145/364005.364057]

4

Daniel G. Bobrow , Ben Wegbreit, A model and stack implementation of multiple environments, Communications of the ACM, v.16 n.10, p.591-603, Oct. 1973  [doi>10.1145/362375.362379]

5

Bobrow, Oanlel G. and wegbreit, Ben. A Model for Control Structures for Artificial Intelligence Programming Languages. Proceedings of IJCAIS, p. 16, Stanford, California, August 1973.

6

Burstall, R.M., et e l . Programming in Pop-2. Edinburgh University Press, 1971.

7

Carbonell, Jalme R. and Colllns, Allan n. Natural Semantics In Artificial Intelligence. Proceedings of IJCAI3, Stanford California, August 1973.

8

Davies, D. Julian R. Popler 1.5 Reference Nanuot. University of Edinburgh, TPU Report No. 1, Ray 1973.

9

Elcock, E.W. et al . Abset, A Programming Language Based on Sets: Notlvatton and Examples. In S. Heltzer and D. Nlchle (Eds.), Hechfne Intellfgence &, Edinburgh University Press, 1971.

10

Feldman, J.A. et al . Recent Developments In Sail--An Algol-based Language for Artificial Intelligence. FJCC, 1972.

11

Jerome A. Feldman , Paul D. Rovner, An ALGOL-based associative language, Communications of the ACM, v.12 n.8, p.439-449, Aug. 1969  [doi>10.1145/363196.363204]

12

Gelernter, H. and Rochester, N. Realization of a Geometry Theorem-proving Hachlne. Proceedfngs of the International Conference on lnformation Processing. Paris, Unesco House, 1959.

13

Ralph E Griswold, The SNOBOL4 programming language, Bell Telephone Laboratories, 1968

14

Hewitt, C. Procedural Embedding of Knowledge In Planner, Proceedings of IJCAI2, London, September 1971.

15

Hewitt, C. Description and Theoretical Analysis (Oatng Schemata) of PIanner, A Language for Proving Theorems and Manipulating Models in a Robot. Al Memo No. 251, HIT Project MAC, April 1972.

16

Hewttt. C. et al . A Universal Modular Actor Formalism for Artificial Intelligence. Proceedings of IJCAI3, Stanford, California, August 1973.

17

Ichbiah, J.D. end Norse, S.P. General Concepts of the Simula OF Programming Language. Compagnie Internationale pour l'Informatique, Paris, September 1971.

18

Kay, A. et al. Smalltalk Notebook. Xerox Palo Alto Research Center, 1973.

19

McDermott, Drew V. and Sussman, Gerald Jay. The Conniver Beferesce RQnual. AI Memo No. 259, MIT Project NAC, Hay 1972.

20

Reboh, Rone and Sacerdoti, Earl. A Preliminary Qlisp Runnel. SRI AI Center Technical Note 81, August 1973.

21

Rulifson, J.F., et al. QA4. A Language for Writing Problem-soiving Programs. Proceedings IFIP Congress, 1968.

22

Rulifson, J.F., et al. QA4, A Procedural Calculus for Intuitive Reasoning. SBI AI Center Technical Note 73, November 1973.

23

Smith, D.C. and Enea, H.J. MLISP2. Stanford AI Lab Hemo AIH-195, Nay 1973.

24

Sussman, Gerald Jay and HcDermott, Drew Vincent. From Conniver to Planner, a genetic Approach. Proceedings of the FJCC, 1972.

25

Gerald Sussman , Terry Winograd, Micro-Planner Reference Manual, Massachusetts Institute of Technology, Cambridge, MA, 1970

26

Daniel Carl Swinehart, Copilot: a multiple-process approach to interactive programming systems., 1974

27

Swinehart, D. and Sproull, B. SAIL. Stanford AI Project Operating Note No. 57.2, January 1971.

28

Teitelman, W. Toward a Programming Laboratory. Proceedings IJCAII, Washington, D.C., J969.

29

Teitelman, W. Interlisp Reference Manual. Xerox Palo Alto Research Center, 1974.

30

Tesler, L.G. et al. The Lisp70 Pattern Matching System. Proceedings IJCAIS, Stanford, California, August 1973.

31

Wegbreit, Ben et al. ECL Prograrmmer's Manual. Harvard UniversLty, September 1972.

Eugene C. Freuder, Synthesizing constraint expressions, Communications of the ACM, v.21 n.11, p.958-966, Nov. 1978

Ralph E. Griswold , David R. Hanson , John T. Korb, Generators in Icon, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.2, p.144-161, April 1981

Neil D. Jones , Steven S. Muchnick, Binding time optimization in programming languages: Some thoughts toward the design of an ideal language, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.77-94, January 19-21, 1976, Atlanta, Georgia

Kapali P. Eswaran, Aspects of a trigger subsystem in an integrated database system, Proceedings of the 2nd international conference on Software engineering, p.243-250, October 13-15, 1976, San Francisco, California, United States

Ralph E. Griswold , David R. Hanson, An Alternative to the Use of Patterns in String Processing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.2, p.153-172, April 1980

Ken-Chih Liu, Extending Earley's context-free parsing algorithm for string pattern matching, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.500-509, February 1988, Atlanta, Georgia, United States

C. Montangero , G. Pacini , F. Turini, Two-level control structure for nondeterministic programming, Communications of the ACM, v.20 n.10, p.725-730, Oct. 1977

C. M. Geschke , J. G. Mitchell, On the problem of uniform references to data structures, ACM SIGPLAN Notices, v.10 n.6, p.31-42, June 1975

Ralph E. Griswold, The Evaluation of Expressions in Icon, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.4, p.563-584, Oct. 1982

David R. Hanson, A procedure mechanism for backtrack programming, Proceedings of the annual conference, p.401-405, October 20-22, 1976, Houston, Texas, United States

Jacques Cohen, Non-Deterministic Algorithms, ACM Computing Surveys (CSUR), v.11 n.2, p.79-94, June 1979

Albert L. Zobrist , Frederick R. Carlson, Jr., Detection of combined occurrences, Communications of the ACM, v.20 n.1, p.31-35, Jan. 1977

Kenneth A. Bowen, Prolog, Proceedings of the 1979 annual conference, p.14-23, January 1979

Ralph E. Griswold , David R. Hanson, Language facilities for programmable backtracking, ACM SIGPLAN Notices, v.12 n.8, p.94-99, August 1977

F. André , J. P. Banatre , J. P. Routeau, A Multiprocessing Approach to Compile-Time Symbol Resolution, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.1, p.11-23, Jan. 1981

James R. Low, Automatic data structure selection: an example and overview, Communications of the ACM, v.21 n.5, p.376-385, May 1978

Eugene C. Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of the ACM (JACM), v.29 n.1, p.24-32, Jan. 1982

Lawrence A. Rowe, Data abstraction from a programming language viewpoint, ACM SIGMOD Record, v.11 n.2, p.29-35, Feb 1981

Terry Winograd, Beyond programming languages, Communications of the ACM, v.22 n.7, p.391-401, July 1979

David R. Hanson , Ralph E. Griswold, The SL5 procedure mechanism, Communications of the ACM, v.21 n.5, p.392-400, May 1978

Michael D. Rychener, Control requirements for the design of production system architectures, ACM SIGPLAN Notices, v.12 n.8, p.37-44, August 1977

Paul F. Dietz, Maintaining order in a linked list, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.122-127, May 05-07, 1982, San Francisco, California, United States

Gary Lindstrom, Backtracking in a Generalized Control Setting, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.1, p.8-26, July 1979

Franco Turini, Magma2: a language oriented toward experiments in control, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.4, p.468-486, Oct. 1984

Alfred Correira, Computing story trees, Computational Linguistics, v.6 n.3-4, p.135-149, July-December 1980

Jerome A. Feldman, High level programming for distributed computing, Communications of the ACM, v.22 n.6, p.353-368, June 1979

Drew McDermott, A deductive model of control of a problem solver, ACM SIGART Bulletin

William C. Nylin , John B. Harvill, Multiple tense computer programming, ACM SIGPLAN Notices, v.11 n.12, December 1976

Ralph E. Griswold, The Icon programming language a new approach to high-level string processing, Proceedings of the 1979 annual conference, p.8-13, January 1979

Robert M. Balzer , Neil M. Goldman , David S. Wile, Operational specification as the basis for rapid prototyping, ACM SIGSOFT Software Engineering Notes, v.7 n.5, p.3-16, December 1982

B Wah , G J Li, Survey on special purpose computer architectures for AI, ACM SIGART Bulletin

Jack Minker, Information storage and retrieval: a survey and functional description, ACM SIGIR Forum, v.12 n.2, p.12-108, Fall 1977

Terry Winograd, Breaking the complexity barrier again, ACM SIGIR Forum, v.9 n.3, p.13-30, Winter 1974

Earl D. Sacerdoti , Richard E. Fikes , Rene Reboh , Daniel Sagalowicz , Richard J. Waldinger , B. Michael Wilber, QLISP: a language for the interactive development of complex systems, Proceedings of the June 7-10, 1976, national computer conference and exposition, June 07-10, 1976, New York, New York

Richard A. LeFaivre, Procedural representation in a fuzzy problem-solving system, Proceedings of the June 7-10, 1976, national computer conference and exposition, June 07-10, 1976, New York, New York

Earl D. Sacerdoti, Problem solving Tactics, Proceedings of the 6th international joint conference on Artificial intelligence, p.1077-1085, August 20-23, 1979, Tokyo, Japan

Robert L. Young, Specification overlays: an application of partitioned semantic networks, Proceedings of the 5th international joint conference on Artificial intelligence, p.348-348, August 22-25, 1977, Cambridge, USA

Daniel G. Bobrow: colleagues

Bertram Raphael: colleagues