On the public citation graph

The essence of program transformation by partial evaluation and driving

https://doi.org/10.1007/bfb0032402
0 signed · 52 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-10250-7_33openalex-snapshot
Semantic definitions in REFAL and automatic production of compilers
inferredcites →https://doi.org/10.1007/3-540-15975-4_48openalex-snapshot
Compiling pattern matching
inferredcites →https://doi.org/10.1007/3-540-57264-3_34openalex-snapshot
Occam's razor in metacomputation: the notion of a perfect process tree
inferredcites →https://doi.org/10.1007/3-540-57880-3_32openalex-snapshot
Towards unifying partial evaluation, deforestation, supercompilation, and GPC
inferredcites →https://doi.org/10.1007/bf03037143openalex-snapshot
Challenging problems in partial evaluation and mixed computation
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/0020-0190(89)90113-0openalex-snapshot
Partial evaluation of pattern matching in strings
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/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1017/cbo9780511569814openalex-snapshot
Projection Factorisations in Partial Evaluation
inferredcites →https://doi.org/10.1017/s0956796800001179openalex-snapshot
Safe fusion of functional expressions II: Further improvements
inferredcites →https://doi.org/10.1093/oso/9780198537809.003.0005openalex-snapshot
Abstract interpretation: a semantics-based tool for program analysis
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/115865.115867openalex-snapshot
Generalized partial computation for a lazy functional language
inferredcites →https://doi.org/10.1145/5956.5957openalex-snapshot
The concept of a supercompiler
inferredcites →https://doi.org/10.1145/96877.96953openalex-snapshot
Application of metasystem transition to function inversion and transformation
inferredcites →https://doi.org/10.2307/2273872openalex-snapshot
A constructive interpretation of the full set theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722010_13openalex-snapshot
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
inferred← citeshttps://doi.org/10.1007/3-540-36377-7openalex-snapshot
The essence of computation: complexity, analysis, transformation
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_13openalex-snapshot
Principles of Inverse Computation and the Universal Resolving Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_18openalex-snapshot
Simple Driving Techniques
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_8openalex-snapshot
Abstraction-Based Partial Deduction for Solving Inverse Problems — A Transformational Approach to Software Verification
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_10openalex-snapshot
Introduction to Supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_2openalex-snapshot
An Introduction to Online and Offline Partial Evaluation Using a Simple Flowchart Language
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_5openalex-snapshot
Logic Program Specialisation
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_13openalex-snapshot
Partial deduction and driving are equivalent
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_46openalex-snapshot
Call-by-name CPS-translation as a binding-time improvement
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_16openalex-snapshot
A Self-Applicable supercompiler
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_21openalex-snapshot
Specialization of imperative programs through analysis of relational expressions
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_24openalex-snapshot
Metacomputation: Metasystem transitions plus supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_8openalex-snapshot
A roadmap to metacomputation by supercompilation
inferred← citeshttps://doi.org/10.1007/bf03160224openalex-snapshot
Inverse computation and the Universal Resolving Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0032761openalex-snapshot
Combining abstract interpretation and partial evaluation (brief overview)
inferred← citeshttps://doi.org/10.1007/bfb0054297openalex-snapshot
Convergence of program transformers in the metric space of trees
inferred← citeshttps://doi.org/10.1007/bfb0056612openalex-snapshot
Staging static analyses using abstraction-based program specialization
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00023-0openalex-snapshot
The universal resolving algorithm and its correctness: inverse computation in a functional language
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00026-xopenalex-snapshot
Convergence of program transformers in the metric space of trees
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1023/a:1007734417713openalex-snapshot
inferred← citeshttps://doi.org/10.1109/icdcs.1999.776525openalex-snapshot
Adapting distributed applications using extensible networks
inferred← citeshttps://doi.org/10.1145/215465.215468openalex-snapshot
Mix ten years later
inferred← citeshttps://doi.org/10.1145/258993.259015openalex-snapshot
Specialization of lazy functional logic programs
inferred← citeshttps://doi.org/10.1145/258994.259015openalex-snapshot
Specialization of lazy functional logic programs
inferred← citeshttps://doi.org/10.1145/289121.289143openalex-snapshot
Using partial evaluation to enable verification of concurrent software
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1145/340855.340885openalex-snapshot
Adapting programming languages technologies for finite-state verification
inferred← citeshttps://doi.org/10.1145/3635800.3636967openalex-snapshot
Partial Evaluation of Reversible Flowchart Programs
inferred← citeshttps://doi.org/10.29007/m8rropenalex-snapshot
On Unfolding for Programs Using Strings as a Data Type
inferred← citeshttps://doi.org/10.4995/thesis/10251/1888openalex-snapshot
Una aproximación offline a la evaluación parcial dirigida por narrowing
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
inferred← citeshttps://doi.org/10.7146/brics.v4i2.18781openalex-snapshot
Abstract Interpretation in the Operational Semantics Hierarchy
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.