The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
The integration of functions into logic programming: From theory to practice
Open accessAbstract
Abstract Functional and logic programming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement of execution principles for such integrated languages, while more recently efficient implementations of these execution principles have been developed so that these languages became relevant for practical applications. In this paper, we survey the development of the operational semantics as well as the improvement of the implementation of functional logic 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
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Foundations of Logic Programming
Lloyd, J. W. (1987) · Springer eBooks · doi:10.1007/978-3-642-83189-8 · Cited by 2,736
Simple Word Problems in Universal Algebras
Knuth, D. E., & BENDIX, P. B. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_23 · Cited by 1,368
Dershowitz, N., & Jouannaud, J.-P. (1991) · Cited by 1,303
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101 · cited 2×
“For instance, the following equality clauses define the semantics of the function append for concatenating lists (we use the Prolog notation for lists [122]):”
Why Functional Programming Matters
Hughes, J. (1989) · The Computer Journal · doi:10.1093/comjnl/32.2.98 · Cited by 734
Computational Problems in Abstract Algebra
(1970) · Elsevier eBooks · doi:10.1016/c2013-0-02156-1 · Cited by 634
Miranda: A non-strict functional language with polymorphic types
Turner, D. A. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15975-4_26 · Cited by 631
Canonical forms and unification
Hullot, J.-M. (1980) · Lecture notes in computer science · doi:10.1007/3-540-10009-1_25 · Cited by 409
Cited by
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Narrowing-driven partial evaluation of functional logic programs
Alpuente, M., Falaschi, M., & Vidal, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61055-3_28 · Cited by 40
Metadata
- Authors
- Hanus, M.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1994-05
- Volume
- 19-20
- Pages
- 583-628
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2059799630
- Cited by
- 419
- References
- 45
- FWCI
- 39.21
- Type
- journal article
- Language
- en
- Open access
- bronze
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 integration of functions into logic programming: From theory to practice. https://app.cochat.ai/papers/10.1016/0743-1066(94)90034-5
- The paper
- Hanus, M. (1994). The integration of functions into logic programming: From theory to practice. The Journal of Logic Programming. https://doi.org/10.1016/0743-1066(94)90034-5
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.