The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
The execution algorithm of mercury, an efficient purely declarative logic programming language
Open accessAbstract
We introduce Mercury, a new purely declarative logic programming language designed to provide the support that groups of application programmers need when building large programs. Mercury's strong type, mode, and determinism systems improve program reliability by catching many errors at compile time. We present a new and relatively simple execution model that takes advantage of the information these systems provide, yielding very efficient code. The Mercury compiler uses this execution model to generate portable C code. Our benchmarking shows that the code generated by our implementation is significantly faster than the code generated by mature optimizing implementations of other logic programming languages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Garbage collection in an uncooperative environment
Boehm, H., & Weiser, M. (1988) · Software: Practice and Experience · doi:10.1002/spe.4380180902 · Cited by 627
(1990) · Cited by 392
Warren's abstract machine a tutorial reconstruction
Aït-Kaci, H. (1999) · Cited by 354
A polymorphic type system for prolog
Mycroft, A., & O'Keefe, R. A. (1984) · Artificial Intelligence · doi:10.1016/0004-3702(84)90017-1 · Cited by 255
Milner, R. (1984) · doi:10.1145/800055.802035 · Cited by 253
The Go¨del programming language
Hill, P. M., & Lloyd, J. W. (1994) · Bristol Research (University of Bristol) · Cited by 168
High-performance logic programming with the Aquarius Prolog compiler
Roy, P. V., & Despain, A. M. (1992) · Computer · doi:10.1109/2.108055 · Cited by 106
LIPS on MIPS: results from Prolog compiler for a RISC
Taylor, A. (1990) · Cited by 52
Detection and optimization of functional computations in Prolog
Debray, S., & Warren, D. S. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_97 · Cited by 50
Analysis of shared data structures for compile-time garbage collection in logic programs
Mulkers, A., Winsborough, W. H., & Bruynooghe, M. (1990) · Lirias · Cited by 31
Cited by
Conjunctive partial deduction: foundations, control, algorithms, and experiments
De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., & Sørensen, M. H. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(99)00030-8 · Cited by 96
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1995) · Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95 · doi:10.1145/215465.215598 · Cited by 16
Metadata
- Authors
- Somogyi, Z., Henderson, F., & Conway, T.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1996-10
- Volume
- 29
- Issue
- 1-3
- Pages
- 17-64
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W1982243747
- Cited by
- 324
- References
- 11
- FWCI
- 17.78
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The execution algorithm of mercury, an efficient purely declarative logic programming language. https://app.cochat.ai/papers/10.1016/s0743-1066(96)00068-4
- The paper
- Somogyi, Z., Henderson, F., & Conway, T. (1996). The execution algorithm of mercury, an efficient purely declarative logic programming language. The Journal of Logic Programming. https://doi.org/10.1016/s0743-1066(96)00068-4
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.
