The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Why untyped nonground metaprogramming is not (much of) a problem
Open accessOverview
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The non-ground representation has semantical problems.
“The non-ground representation also has semantical problems (although they were solved to some extent in [20,66,67]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [67]
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
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
Schreye, D., & Martens, B. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-56282-6_13 · Cited by 10
Self-citation
Flagged first, then by citations
Research works printed but not linked: 11
- Bowen, 1985, Meta-Level Programming and Knowledge Representation, New Generation Comput., 3, 359, 10.1007/BF03037077 · DOI
- Bry, 1990, Query Evaluation in Recursive Databases: Bottom-Up and Top-Down Reconciled, Data Knowledge Eng., 5, 289, 10.1016/0169-023X(90)90017-8 · DOI
- Chen, 1993, HiLog: A Foundation for Higher-Order Logic Programming, J. Logic Program., 15, 187, 10.1016/0743-1066(93)90039-J · DOI
- Demolombe, 1992, Syntactical Characterization of a Subset of Domain Independent Formulas, J. ACM, 39, 71, 10.1145/147508.147520 · DOI
- Denecker, 1990, Terms in Logic Programs: A Problem with Their Semantics and Its Effect on the Programming Methodology, CCAI, J. Integrated Study of Artificial Intelligence, Cognitive Sci. Appl. Epistemology, 7, 363
- Falaschi, 1989, Declarative Modeling of the Operational Behavior of Logic Programs, Theoret. Comput. Sci., 69, 289, 10.1016/0304-3975(89)90070-4 · DOI
- Falaschi, 1993, A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs, Inform. Computation, 103, 86, 10.1006/inco.1993.1015 · DOI
- Przymusinska, 1990, Weakly Stratified Logic Programs, Fundamenta Informaticae, XIII, 51, 10.3233/FI-1990-13106 · DOI
- Richards, 1974, A Point of Reference, Synthese, 28, 361, 10.1007/BF00877581 · DOI
- Sterling, 1989, Meta Interpreters for Expert System Construction, J. Logic Program., 6, 163, 10.1016/0743-1066(89)90034-4 · DOI
- Van Gelder, 1991, The Well-Founded Semantics for General Logic Programs, J. ACM, 38, 620, 10.1145/116825.116838 · DOI · Paper page
Cited by
Sorted by citations
Creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10012-7 · Cited by 29
Metadata
- Authors
- Martens, B., & de Schreye, D.
- Affiliations
- KU Leuven (BE)
- Corresponding author
- Martens, Bern
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1995-01
- Volume
- 22
- Issue
- 1
- Pages
- 47-99
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2066992739
- Cited by
- 23
- References
- 2
- Citations by year
- 2019: 1
- FWCI
- 4.29
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- The Journal of Logic Programming (publishedVersion)
- Lirias (KU Leuven) (acceptedVersion, other-oa)
- Funders
- Fonds De La Recherche Scientifique - FNRS
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
- Keywords
- metaprogramming, language independence, range restriction, amalgamation, logic programming semantics
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
