A view of the origins and development of Prolog

ABSTRACT

Dealing with failure is easy: Work hard to improve. Success is also easy to handle: You've solved the wrong problem. Work hard to improve.

REFERENCES

• 1: Friedrich L. Bauer, Historical Remarks on Compiler Construction, Compiler Construction, An Advanced Course, 2nd ed., p.603-621, January 1976
• 2: Boyer, R.S., and Moore, J.S. The sharing of structure in theorem proving programs. In Machine Intelligence, vol. 7. M. Melzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, U.K., 1972, pp. 101-116.
• 3: R. A. Brooker , D. Morris, A General Translation Program for Phrase Structure Languages, Journal of the ACM (JACM), v.9 n.1, p.1-10, Jan. 1962 [doi>10.1145/321105.321106]
• 4: Brooker, R.A., MacCallum, I.R., Morris, D., and Rohl, }.S. The compiler-compiler. Annu. Rev. Autom. Program. 3 (1963), 229-275.
• 5: Clark, K. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum, New York, 1978, pp. 293-322.
• 6: Jacques Cohen, Describing Prolog by its interpretation and compilation, Communications of the ACM, v.28 n.12, p.1311-1324, Dec. 1985 [doi>10.1145/214956.214960]
• 7: Alain Colmerauer, Total Precedence Relations, Journal of the ACM (JACM), v.17 n.1, p.14-30, Jan. 1970 [doi>10.1145/321556.321559]
• 8: Colmerauer, A. Les Syst~mes-Q ou un formalisme pour analyser et synth6tiser des phrases sur ordinateur, Rep. 43, Dept. of Computer Science, Univ. of Montreal, Quebec, 1970.
• 9: Alain Colmerauer, Metamorphosis Grammars, Natural Language Communication with Computers, p.133-189, January 1978
• 10: Colmerauer, A. Prolog and infinite trees. In Logic Programming, K. Clark and S. A. Tarnlund, Eds. Academic Press, New York, 1982, pp. 231-251.
• 11: Colmerauer, A. Equations and inequations on finite and infinite trees. In Proceedings on the International Conference on Fifth Generation Computer Systems {Tokyo, Japan, Nov.). ICOT, Tokyo, 1984.
• 12: Colmerauer, A., Kanoui, H., Pasero, R., and Roussel, P. Un syst~me De communication homme-machine en Franqais. Res. Rep., Groupe Intelligence Artificielle, Univ. Aix-Marseille II, France, 1973.
• 13: Guy de Chastellier , Alain Colmerauer, W-grammar, Proceedings of the 1969 24th national conference, p.511-518, August 26-28, 1969 [doi>10.1145/800195.805957]
• 14: Dijkstra, E.W. ALGOL 60 translation. ALGOL Bull. {supplement) 10 (1960). (Also: Recursive programming. Numer. Math. 2 (1960), 312-318.}
• 15: Robert W. Floyd, Syntactic Analysis and Operator Precedence, Journal of the ACM (JACM), v.10 n.3, p.316-333, July 1963 [doi>10.1145/321172.321179]
• 16: Robert W. Floyd, Nondeterministic Algorithms, Journal of the ACM (JACM), v.14 n.4, p.636-644, Oct. 1967 [doi>10.1145/321420.321422]
• 17: Green, C.C. Theorem proving by resolution as a basis for questionanswering systems. In Machine Intelligence, vol. 4. B. Melzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, U.K., 1969, pp. 183-205.
• 18: T. V. Griffiths , S. R. Petrick, On the relative efficiencies of context-free grammar, Communications of the ACM, v.8 n.5, p.289-300, May 1965 [doi>10.1145/364914.364943]
• 19: Hill, R. LUSH-resolution and its completeness. DCL Memo 78, Dept. of Artificial Intelligence, Univ. of Edinburgh, U.K., 1974.
• 20: John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 21: Irons, E.T. The structure and use of the syntax directed compiler. Annu. Rev. Autom. Program. 3 {1963), 207-227.
• 22: Knuth, D.E. On the translation of languages from left to right. Inf. Control 8, 6 (1965), 607-639.
• 23: Knuth, D.E. Semantics of context-flee languages. Math. Syst. Theory 2, 2 {1968), 127-145.
• 24: Kowalski, R. Predicate logic as programming language. In Proceedings of IFIP, 74 {1974). North Holland Publishing Co., Amsterdam, 1974, 569-574.
• 25: Robert Kowalski, Logic for problem-solving, North-Holland Publishing Co., Amsterdam, The Netherlands, 1986
• 26: Kowalski, R. The early history of logic programming. Dept. of Gomputing, Imperial College, London, Oct. 1984.
• 27: Kowalski, R., and Kuehner, D. Resolution with selection function. Artif. Intelt. 2, 3 {1970), 227-260.
• 28: D. W. Loveland, A Simplified Format for the Model Elimination Theorem-Proving Procedure, Journal of the ACM (JACM), v.16 n.3, p.349-363, July 1969 [doi>10.1145/321526.321527]
• 29: Loveland, D.W. Automated theorem proving: A quarter-century review. Am. Math. Soc. 29 (1984), 1-42.
• 30: John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
• 31: John McCarthy, History of LISP, The first ACM SIGPLAN conference on History of programming languages, p.217-223, June 01-03, 1978, Los Angeles, CA [doi>10.1145/960118.808387]
• 32: J. W. Backus , F. L. Bauer , J. Green , C. Katz , J. McCarthy , A. J. Perlis , H. Rutishauser , K. Samelson , B. Vauquois , J. H. Wegstein , A. van Wijngaarden , M. Woodger , P. Naur, Revised report on the algorithm language ALGOL 60, Communications of the ACM, v.6 n.1, p.1-17, Jan. 1963 [doi>10.1145/366193.366201]
• 33: Paul, M. A general processor for certain formal languages. In Proceedings of the Symposium on Symbolic Languages in Data Processing (Rome, Italy). Gordon and Breach, New York, 1962, pp. 65-74.
• 34: Pereira, F.C., and Warren, D.H.D. Definite clause grammars for language analysis. Artif. Intell. 13 {1980}, 231-278.
• 35: Fernando C. N. Pereira , David H. D. Warren, Parsing as deduction, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts [doi>10.3115/981311.981338]
• 36: J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
• 37: Robinson, J.A. Logic programming--Past, present and future. New Generation Comput. I (1983), 107-124.
• 38: Roussel, P. Definition et traitement de l'egalit~ formelle en d6monstration automatique. Thesis, Facult6 des Sciences, Univ. d'Aix- Marseille, Luminy, France, 1972.
• 39: Roussel, P. Prolog: Manuel de r6f~rence et d'utilisation. Groupe d'Intelligence Artificielle, Univ. d'Aix-Marseille, Luminy, France, 1975.
• 40: K. Samelson , F. L. Bauer, Sequential formula translation, Communications of the ACM, v.3 n.2, p.76-83, Feb. 1960 [doi>10.1145/366959.366968]
• 41: M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
• 42: Van Wijngaarden, A., Mailloux, B.J., Peck, J.L., Koster, C.H.A., Sintzoff, M., Lindsey, C.H., Meertens, L.G.L.T., and Fisker, R.G. Revised report on the algorithmic language ALGOL 68. Acla Info. 5, 1-3 (1975), 1-236.
• 43: Warren, D.H.D. Applied logic--Its use and implementation as a programming tool, Ph.D. dissertation. Dept. of Artificial Intelligence, Univ. of Edinburgh, Edinburgh, U.K., 1977, Also: Tech. Note 290, SRI International, Menlo Park, Calif., 1983.
• 44: Warren, D.H.D, Logic programming and compiler writing. Softw. Pract. Exper. 10 (Feb. 1980), 97-125.
• 45: Niklaus Wirth , Helmut Weber, EULER: a generalization of ALGOL and it formal definition: Part 1, Communications of the ACM, v.9 n.1, p.13-25, Jan. 1966 [doi>10.1145/365153.365162]

INDEX TERMS

Primary Classification:
  K. Computing Milieux

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

  K. Computing Milieux
  K.2 HISTORY OF COMPUTING
      Subjects: People; Software

General Terms:
Human Factors, Languages