Prolog - the language and its implementation compared with Lisp
Open accessThe DOI matches its Crossref record.
Abstract
Prolog is a simple but powerful programming language founded on symbolic logic. The basic computational mechanism is a pattern matching process (“unification”) operating on general record structures (“terms” of logic). We briefly review the language and compare it especially with pure Lisp. The remainder of the paper discusses techniques for implementing Prolog efficiently; in particular we describe how to compile the patterns involved in the matching process. These techniques are as incorporated in our DECsystem-10 Prolog compiler (written in Prolog). The code it generates is comparable in speed with that produced by existing DEC10 Lisp compilers. We argue that pattern matching is a better method for expressing operations on structured data than conventional selectors and constructors - both for the user and for the implementor.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Generative communication in Linda
Gelernter, D. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2363.2433 · Cited by 2,266
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Pereira, F. C. N., & Warren, D. H. D. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90003-x · Cited by 978
Self-citationAn Efficient Unification Algorithm
Martelli, A., & Montanari, U. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357169 · Cited by 776
Kowalski, R. (1979) · Communications of the ACM · doi:10.1145/359131.359136 · Cited by 600
Prolog and Natural Language Analysis
Harrison, S. P., Pereira, F. C. N., & Shieber, S. M. (1988) · Language · doi:10.2307/414538 · Cited by 364
Self-citationUeda, K. (1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-16479-0_17 · Cited by 330
An efficient easily adaptable system for interpreting natural language queries
Warren, D. H. D., & Pereira, F. C. N. (1982) · doi:10.5555/972942.972944 · Cited by 275
Self-citationColmerauer, A., & Roussel, P. (1993) · The second ACM SIGPLAN conference on History of programming languages · doi:10.1145/154766.155362 · Cited by 108
“David Warren later included grammar rules of this sort in his compiled version of Prolog [39] and together with Fernando Pereira rechristened a simplified variant of metamorphosis grammars with the name, ‘definite clause grammars’ [33].”
Background
Metadata
- Authors
- Warren, D. H. D., Pereira, L. M., & Pereira, F.
- Venue
- Proceedings of the 1977 symposium on Artificial intelligence and programming languages -
- Publisher
- ACM Press
- Published
- 1977
- Pages
- 109-115
- OpenAlex
- W2112962394
- Cited by
- 241
- References
- 0
- FWCI
- 7.64
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.