Describing Prolog by its interpretation and compilation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Describing Prolog by its interpretation and compilation

Full text

Pdf (1.50 MB)

Source

Communications of the ACM archive
Volume 28 , Issue 12 (December 1985) table of contents

Pages: 1311 - 1324

Year of Publication: 1985

ISSN:0001-0782

Author

Jacques Cohen

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 48, Citation Count: 16

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/214956.214960 What is a DOI?

ABSTRACT

Since its conception, Prolog has followed a developmental course similar to the early evolution of LISP. Although the version of Prolog described here typifies that currently in use, it should be considered within the framework of language evolution.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bruynooghe. M. A note on garbage-collection in Prolog interpreters. In Iwplenwrfa,'iou of Prolog, Ellis Horwood Series in Artificial Intelligence. J.A. Ca~npbell. Ed. Wiley. New York. 1984. pp. 258-267.
	2	Campbell. J.A.. Ed. In~plentenlafior~ of Prolog. Ellis Horwood Series in Artificial Intelligence. Wiley, New York, 1984.
	3	K. L Clark , F. G McCabe, Micro-PROLOG: programming in logic, Prentice-Hall, Inc., Upper Saddle River, NJ, 1984
	4	K. L. Clark , S.-A TFarnlund, Logic Programming, Academic Press, Inc., Orlando, FL, 1982
	5	W F. Clocksin , Christopher S. Mellish, Programming in Prolog (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1984
	6	Coelho. H.. Cotta. J.C.. and Per&a. L.M. How to solve it in Prolog. Laboratorio N,uzional de Engenharia Civil, Lisbon, Portugal. 1980.
	7	Jacques Cohen, Non-Deterministic Algorithms, ACM Computing Surveys (CSUR), v.11 n.2, p.79-94, June 1979 [doi>10.1145/356770.356773]
	8	Alain Colmerauer, Metamorphosis Grammars, Natural Language Communication with Computers, p.133-189, January 1978
	9	Colmerauer. A. Prolog and infinite trees. In Logic Programnling. K.L. Clark and S.A Tarnlund. Eds. Academic Press. New York, 1982, pp. 231-2.51.
	10	Colmerauer. A. Equations and inequalities on finite and infinite trees. Groupe *d'lntelligence Artificielle. Universit6 Aix-Marseille II. prance. 1984.
	11	Colmerauer. A.. Kanoui. H.. and van Caneghem. M. Prolog II. Groupe d'Intelligence Artificielle. University of Marseilles-Luminy. France. 1982.
	12	Conery. J.S. The and/or process model for parallel interpretation of logic programs. Tech. Rep., Univ. of California. Irvine. May 1980.
	13	Davis. R.E. Logic programming and Prolog: A tutorial. IEEE Soffm. 2, 5 {Sept. 1985). 53-62.
	14	Cynthia Dwork , Paris C. Kanellakis , John C. Mitchell, On the sequential nature of unification, Journal of Logic Programming, v.1 n.1, p.35-50, June 1984 [doi>10.1016/0743-1066(84)90022-0]
	15	Herve Gallaire , Jack Minker, Logic and Data Bases, Perseus Publishing, 1978
	16	Michael R. Genesereth , Matthew L. Ginsberg, Logic programming, Communications of the ACM, v.28 n.9, p.933-941, Sept. 1985 [doi>10.1145/4284.4287]
	17	Giannesini. F.. and Cohen, J. Parser generation and grammar manipulations using Prolog's infinite trees. /. Logic Program. (Oct. 19841, 253-265.
	18	Françis Giannesini , Henry Kanoui , Robert Pasero , Michel van Caneghem, Prolog, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	19	Christopher John Hogger, Introduction to logic programming, Academic Press Professional, Inc., San Diego, CA, 1984
	20	IEEE. Proceedi,;gs of f/w lrr~er~laffonal Symposrunt on Logic Programnlirlg. IEEE. Atlantic City, N.J.. Feb. 1984.
	21	1EEE. Procredhgs IIf file Synrposiunl 011 Logic Progran~nring. IEEE, Boston. Mass.. July 1985. 22. Kluzniak. F.. and Szpakowicz. S. Prolog for Programmers. Academic Press. New York. 1985. 23. Kowalski. R.A. Algorithm = logic + control. Comntun. ACM 22. 7 (July 1979). 424-436. 24. Kowalski, R.A. Logic for Problenr Solviq. Elsevier North-Holland. New York, 1979. 25. Kowalski. R.A. Logic as a computer language. In Logic Programnkg, K.L. Clark and S.A. Tarnlund. Eds. Academic Press. New York. 1982. pp. 3-16. 26. Li. D. A Prolog Dafa Base System. Research Studies Press, Wiley, New York. 1984. 27. Lloyd, J.W. Foundatiom of Logic Progranmktg. Springer-Verlag. New York. 1984. 28. Martelli. A., and Montanari. U. An efficient unification algorithm. ACM Traw Progran!. Laq. Sysf. 4. 2 (Apr. 1982). 258-282. 29. Mellish, C.. and Hardy, S. Integrating Prolog in the poplog environment. In Impltmenfafiott of Prolog, Ellis Horwood Series in Artificial Intelligence. J.A. Campbell, Ed. Wiley. New York. 1984. 30. Mellish. C.S. Some global optimizations for a Prolog compiler. I. Logic Program. 2. 1 (Apr. 1985). 43-66. 31. Pereira. F.C.. and Warren. D.H. Definite clause grammars for language analysis. Artif. Intell. 13 (1980). 231-278. 32. Pereira, L.M.. et al. Eds. Proceeditlgs Logic Progranrming Workshop. Algarve. Portugal. July 1983. 33. Pique. J.F. Drawing trees and their equations in Prolog. In Proceedings of t/w Second I~rler~rafional Logic Programming Couferewe. UPMAlL. Univ. of Uppsala, Sweden, July 1984. pp. 23-33. 34. Poe, M.D.. Nasr, R.. Potter, J., and Slinn, J. A Kwic bibliography on Prolog and logic programming. 1. Logic Program. I (1984). 81-142. 35. Robinson, J.A. A machine-oriented logic based on the resolution principle. 1. ACM 12, 1 (Jan. 1965). 23-41. 36. Robinson, J.A. Computational logic: The unification computation. Mach. Intel/. 6 (1971). 63-72. 37. Robinson, J.A. Logic programming-Past. present and future. New Generation Conlpuf. I (1983). 107-124. 38. Shapiro. E. Algorithmic program debugging. Ph.D. dissertation, Yale Univ.. MIT Press. Cambridge, Mass., 1982. 39. Shapiro. E. Systems programming in concurrent Prolog. ICOT Tech. Rep., Nov. 1983. 40. Univ. of Uppsala. Proceedings of fhe 2ud Inrernational Logic Programming Conferewe. UP-MAIL. Univ. of Uppsala. Sweden, July 1984. 41. van Caneghem. M.. Ed. Proceedings of the 1st Infernational Logic Progranlnlirlg Couferewe. Faculti! des Sciences de Luminy. Marseilles. France. Sept. 1982. 42. van Caneghem. M. L'anatomie de Prolog II (in French). Ph.D. dissertation. Universitk d'Aix-Marseille Il. France, Oct. 1984. van Emden. M.H.. and Kowalski, R.A. The semantics of predicate 43. logic as a programming language. 1. ACM 23, 4 (Oct. 1976). 733-742. 44. Warren. D.H.D. Applied logic-Its use and implementation as a programming tool. Ph.D. dissertation. Univ. of Edinburgh. 1977 (also appeared as Tech. Note 290. SRI International. Menlo Park. Calif., 1983). 45. Warren. D.H.D. Logic programming and compiler writing. Softw. Pracf. Exper. 10 (Feb. 1980). 97-125. 46. Warren, D.H.D. An abstract Prolog instruction sat. Tech. Note 309. SRI International. Menlo Park. Calif.. Oct. 1983. 47. Yasuura. H. On the parallel computational complexity of unification. In Proceedirlgs of fhe International Conference on Fifth Generation Con~pufmg Sysfems (Tokyo. Japan, Nov. 6-9). 1984. pp. 235-243.

CITED BY 16

	Ralph E. Griswold , Madge T. Griswold, History of the Icon programming language, ACM SIGPLAN Notices, v.28 n.3, p.53-68, March 1993
	Jacques Cohen , Timothy J. Hickey, Parsing and compiling using Prolog, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.2, p.125-163, April 1987
	John Najarian, Modeling in Prolog, ACM SIGCSE Bulletin, v.20 n.1, p.259-262, Feb. 1988
	Jacques Cohen, A view of the origins and development of Prolog, Communications of the ACM, v.31 n.1, p.26-36, Jan. 1988
	Jacques Cohen, Logic programming and constraint logic programming, ACM Computing Surveys (CSUR), v.28 n.1, p.257-259, March 1996
	Yim Yung Leung , Dik Lun Lee, Logic Approaches for Deductive Databases, IEEE Expert: Intelligent Systems and Their Applications, v.3 n.4, p.64-75, December 1988
	Sebastian Millies, Modularity, parallelism, and licensing in a principle-based parser for German, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
	Charles Rich , Richard C. Waters, Automatic Programming: Myths and Prospects, Computer, v.21 n.8, p.40-51, August 1988
	Mark Johnson, Deductive parsing with multiple levels of representation, Proceedings of the 26th annual meeting on Association for Computational Linguistics, p.241-248, June 07-10, 1988, Buffalo, New York
	Ralph E. Griswold , Madge T. Griswold, History of the Icon programming language, History of programming languages---II, ACM Press, New York, NY, 1996
	Bruce S. Elenbogen , Martha R. O'Kennon, Teaching recursion using fractals in Prolog, ACM SIGCSE Bulletin, v.20 n.1, p.263-266, Feb. 1988
	Tim Wahls , Gary T. Leavens , Albert L. Baker, Executing Formal Specifications with Concurrent Constraint Programming, Automated Software Engineering, v.7 n.4, p.315-343, December 2000
	Charlotte Herzeel , Kris Gybels , Pascal Costanza , Coen De Roover , Theo D'Hondt, Forward chaining in HALO: An implementation strategy for history-based logic pointcuts, Computer Languages, Systems and Structures, v.35 n.1, p.31-47, April, 2009
	Erich Schikuta, An exemplary approach to the education of rule-based languages, ACM SIGCSE Bulletin, v.19 n.2, p.43-45, June 1987
	J. O'Bagy , R. E. Griswold, A recursive interpreter for the Icon programming language, ACM SIGPLAN Notices, v.22 n.7, p.138-149, July 1987
	Charlotte Herzeel , Kris Gybels , Pascal Costanza , Coen De Roover , Theo D'Hondt, Forward chaining in HALO: an implementation strategy for history-based logic pointcuts, Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007, August 25-31, 2007, Lugano, Switzerland