On the public citation graph
A self-applicable partial evaluator and its use in incremental compilation
0 signed · 38 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.
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.
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/3-540-16492-8_70openalex-snapshot
How to invent a Prolog machine
inferredcites →https://doi.org/10.1007/3-540-16492-8_92openalex-snapshot
Qualified answers and their application to transformation
inferredcites →https://doi.org/10.1016/0004-3702(76)90011-4openalex-snapshot
A partial evaluator, and its use as a programming tool
inferredcites →https://doi.org/10.1145/582153.582181openalex-snapshot
Partial evaluation as a means for inferencing data structures in an applicative language
inferredcites →https://doi.org/10.1145/988346.988358openalex-snapshot
An experiment in partial evaluation
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-36377-7_17openalex-snapshot
Homeomorphic Embedding for Online Termination of Symbolic Methods
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_52openalex-snapshot
Role of logic programming in the FGCS project
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_94openalex-snapshot
Semantics-directed generation of a Prolog compiler
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_26openalex-snapshot
A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_4openalex-snapshot
An introduction to partial deduction
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_8openalex-snapshot
Partial evaluation of the “real thing”
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_9openalex-snapshot
Reasoning about hierarchies of online program specialization systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3156-4_4openalex-snapshot
Problem-Solving and Inference Software
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_16openalex-snapshot
Semantics—based Partial Evaluation of Prolog Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_15openalex-snapshot
Logimix: A Self-Applicable Partial Evaluator for Prolog
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_8openalex-snapshot
LIX: an Effective Self-applicable Partial Evaluator for Prolog
inferred← citeshttps://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
inferred← citeshttps://doi.org/10.1007/bf03037137openalex-snapshot
Partial evaluation with inference rules
inferred← citeshttps://doi.org/10.1007/bf03037139openalex-snapshot
Partial evaluation of metaprograms in a “multiple worlds” logic language
inferred← citeshttps://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
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/bfb0013539openalex-snapshot
Data-driven transformation of meta-interpreters: A sketch
inferred← citeshttps://doi.org/10.1007/s00354-019-00058-yopenalex-snapshot
From Fifth Generation Computing to Skill Science
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90011-dopenalex-snapshot
Semantics-directed generation of a prolog compiler
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(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90052-6openalex-snapshot
Interpretational abstraction
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10012-7openalex-snapshot
Creating specialised integrity checks through partial evaluation of meta-interpreters
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1145/154630.154640openalex-snapshot
Tutorial on specialisation of logic programs
inferred← citeshttps://doi.org/10.1145/215465.215598openalex-snapshot
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
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.