On the public citation graph

Partial evaluation of metaprograms in a “multiple worlds” logic language

https://doi.org/10.1007/bf03037139
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-15976-2_6openalex-snapshot
An experiment in partial evaluation: The generation of a compiler generator
inferredcites →https://doi.org/10.1007/bf03037133openalex-snapshot
A self-applicable partial evaluator and its use in incremental compilation
inferredcites →https://doi.org/10.1016/0020-0190(77)90078-3openalex-snapshot
On the partial computation principle
inferredcites →https://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferredcites →https://doi.org/10.1109/mc.1986.1663178openalex-snapshot
Learning from AI: New Trends in Database Technology
inferredcites →https://doi.org/10.1109/mc.1986.1663307openalex-snapshot
Concurrent Prolog: A Progress Report
inferredcites →https://doi.org/10.1145/582153.582181openalex-snapshot
Partial evaluation as a means for inferencing data structures in an applicative language

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45628-7_8openalex-snapshot
Transformation Systems and Nondeclarative Properties
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_10openalex-snapshot
Metalogic for state oriented programming
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_16openalex-snapshot
Specialising meta-level compositions of logic programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_12openalex-snapshot
Specialising the Ground Representation in the Logic Programming Language Gödel
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_14openalex-snapshot
An Unfold Rule for Full Prolog
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_6openalex-snapshot
The Transformational Approach to Program Development
inferred← citeshttps://doi.org/10.1007/978-3-642-75182-0_2openalex-snapshot
Meta-Programming for Knowledge Base Systems
inferred← citeshttps://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferred← citeshttps://doi.org/10.1007/bf03037314openalex-snapshot
A program specialiser for meta-level compositions of logic programs
inferred← citeshttps://doi.org/10.1007/bf03037500openalex-snapshot
Towards efficient partial evaluation in logic programming
inferred← citeshttps://doi.org/10.1007/bf03037513openalex-snapshot
How to control unfolding when specializing interpreters
inferred← citeshttps://doi.org/10.1007/bf03037527openalex-snapshot
A general criterion for avoiding infinite unfolding during partial deduction
inferred← citeshttps://doi.org/10.1007/bf03038271openalex-snapshot
Mixtus: An automatic partial evaluator for full Prolog
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90203-8openalex-snapshot
Sound and complete partial deduction with unfolding based on well-founded measures
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90023-aopenalex-snapshot
Basic transformation operations which preserve computed answer substitutions of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90026-4openalex-snapshot
The s-semantics approach: Theory and applications
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1145/115865.115869openalex-snapshot
Determinacy analysis for full Prolog
inferred← citeshttps://doi.org/10.1145/115866.115869openalex-snapshot
Determinacy analysis for full Prolog
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0059openalex-snapshot
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.