On the public citation graph
Mixed computation of Prolog programs
0 signed · 34 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.1002/spe.4380100203openalex-snapshot
Logic programming and compiler writing
inferredcites →https://doi.org/10.1007/3-540-08353-7_128openalex-snapshot
Correctness of mixed computation in ALGOL-like programs
inferredcites →https://doi.org/10.1007/3-540-11980-9_13openalex-snapshot
Partial computation of programs
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-16446-4_14openalex-snapshot
The structure of a self-applicable partial evaluator
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
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.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.030openalex-snapshot
Flow analysis of lazy higher-order functional programs
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/16894.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/954063.954069openalex-snapshot
A supercompiler system based on the language REFAL
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-50940-2_29openalex-snapshot
A self-applicable partial evaluator for term rewriting systems
inferred← citeshttps://doi.org/10.1007/3540543961_8openalex-snapshot
A strongly-typed self-applicable partial evaluator
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-4615-3422-8_9openalex-snapshot
Extending Partial Evaluation in Logic Programming
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/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
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.1016/0304-3975(90)90198-qopenalex-snapshot
Mixed computation and compilation: New approaches to old problems
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.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1109/iccl.1990.63760openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferred← citeshttps://doi.org/10.1145/128861.128864openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferred← citeshttps://doi.org/10.1145/154630.154642openalex-snapshot
Online partial deduction of logic programs
inferred← citeshttps://doi.org/10.35537/10915/4170openalex-snapshot
Type specialisation of polymorphic languages
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.