article

Free access

Describing Prolog by its interpretation and compilation

Author:

Jacques CohenAuthors Info & Claims

Communications of the ACM, Volume 28, Issue 12

Pages 1311 - 1324

https://doi.org/10.1145/214956.214960

Published: 01 December 1985 Publication History

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

[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]

Clark. K.L. and McCabe. F.C. Micro-Prolog: Progranrmiug iv Logic. Prentice-Hall. En&wood Cliffs, N.1. 1984.

Digital Library

[4]

Clark. K.L. and Tarnlund. S.A., Eds. Logic Programn~ing. Academic Press. New York. 1982.

Digital Library

[5]

Clocksin. W.F. and Mellish. C.S. Progranlmixg in Prolog. 2nd ed. Springer-Verlag. New York. 1984.

Digital Library

[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]

Cohen. J. Nondetarministic algorithms. Comput. Suru. II, 2 (June 1979). 79-94.

Digital Library

[8]

Colmerauer. A. Les grammaires de metamorphose. Groupe d'lntelligence Artificit!lle. Univ. of Marseilles-Luminy. France, 1975. (Appears as Metamorphosis grammars. In Natural Language Conmwricafiorr roil/r Conrputers. 1. Bale. Ed. Springer-Verlag. New York, 1978. pp. 133-189.)

Digital Library

[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.

Digital Library

[14]

Dwork. C. Kanellaris. P.C., and Mitchell. J.C. On the sequential nature of unification. 1. Logic Program. 1 (1984), 35-50.

Digital Library

[15]

Gallaire. H. and Minker. 1. Eds. Logic and Data Bases. Plenum. New York. 1977.

Digital Library

[16]

Genesereth. M.R. and Ginsberg. M.L. Logic programming. Comnrun. ACM 28, 9 (Sept. 1985). 933-941.

Digital Library

[17]

Giannesini. F. and Cohen, J. Parser generation and grammar manipulations using Prolog's infinite trees. /. Logic Program. (Oct. 19841, 253-265.

[18]

Giannesini. F. Kanoui. H. Pasero. R., and van Caneghem. M. Prolog will be published by Addison-Wesley. Reading. Mass.).

Digital Library

[19]

Hogger. C.J. lrzfrodurfiorr to Logic Progranm~ing. Academic Press, New York. 19~4.

Digital Library

[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

Cohen J(2014)Logic Programming and Constraint Logic ProgrammingComputing Handbook, Third Edition10.1201/b16812-74(1-32)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-74
Mueller C(2012)Axiom based architectureACM SIGARCH Computer Architecture News10.1145/2234336.223433940:2(10-17)Online publication date: 31-May-2012
https://dl.acm.org/doi/10.1145/2234336.2234339
(2012)ReferencesLees' Loss Prevention in the Process Industries10.1016/B978-0-12-397189-0.00123-3(3129-3580)Online publication date: 2012
https://doi.org/10.1016/B978-0-12-397189-0.00123-3
Show More Cited By

Index Terms

Describing Prolog by its interpretation and compilation
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
      2. Language types

Recommendations

Efficient interpretation of Prolog programs
SIGPLAN '87: Papers of the Symposium on Interpreters and interpretive techniques

The paper focuses on three ideas for solving problems with writing interpreters for the logic programming language Prolog in Prolog and how to combine these ideas to an interpreter for Prolog which is both simple and efficient. The resulting interpreter ...
Efficient interpretation of Prolog programs

The paper focuses on three ideas for solving problems with writing interpreters for the logic programming language Prolog in Prolog and how to combine these ideas to an interpreter for Prolog which is both simple and efficient. The resulting interpreter ...
Compilation or interpretation
CSC '89: Proceedings of the 17th conference on ACM Annual Computer Science Conference

Processing programs written in languages of higher-level requires the steps of compilation and execution or interpretation for obtaining results. Both steps are considered to be different methods [1,2]. The only difference, however, is in fact the ...

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM

Communications of the ACM Volume 28, Issue 12

Dec. 1985

68 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/214956

Editor:
Peter J. Denning

Issue’s Table of Contents

Copyright © 1985 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1985

Published in CACM Volume 28, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
1,166
Total Downloads

Downloads (Last 12 months)158
Downloads (Last 6 weeks)15

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Cohen J(2014)Logic Programming and Constraint Logic ProgrammingComputing Handbook, Third Edition10.1201/b16812-74(1-32)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-74
Mueller C(2012)Axiom based architectureACM SIGARCH Computer Architecture News10.1145/2234336.223433940:2(10-17)Online publication date: 31-May-2012
https://dl.acm.org/doi/10.1145/2234336.2234339
(2012)ReferencesLees' Loss Prevention in the Process Industries10.1016/B978-0-12-397189-0.00123-3(3129-3580)Online publication date: 2012
https://doi.org/10.1016/B978-0-12-397189-0.00123-3
Herzeel CGybels KCostanza PDe Roover CD'Hondt T(2009)Forward chaining in HALOComputer Languages, Systems and Structures10.1016/j.cl.2008.06.00235:1(31-47)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1016/j.cl.2008.06.002
Herzeel CGybels KCostanza PDe Roover CD'Hondt TDemeyer SPerrot J(2007)Forward chaining in HALOProceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 200710.1145/1352678.1352689(157-182)Online publication date: 25-Aug-2007
https://dl.acm.org/doi/10.1145/1352678.1352689
(2005)References, Part 2Lees' Loss Prevention in the Process Industries10.1016/B978-075067555-0.50264-4(51-100)Online publication date: 2005
https://doi.org/10.1016/B978-075067555-0.50264-4
Spinellis DDrossopoulou SEisenbach S(2005)Language and architecture paradigms as object classes: A unified approach towards multiparadigm programmingProgramming Languages and System Architectures10.1007/3-540-57840-4_32(191-207)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57840-4_32
Abdulrab H(2005)LOP: Toward a new implementation of Makanin's AlgorithmWord Equations and Related Topics10.1007/3-540-56730-5_35(133-149)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-56730-5_35
Jorrand P(2005)Fundamental mechanisms for artificial intelligence programming languagesAdvanced Topics in Artificial Intelligence10.1007/3-540-50676-4_8(1-40)Online publication date: 9-Jun-2005
https://doi.org/10.1007/3-540-50676-4_8
Stickel M(2005)A prolog technology theorem prover: Implementation by an extended prolog compiler8th International Conference on Automated Deduction10.1007/3-540-16780-3_122(573-587)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16780-3_122
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents