On the public citation graph

Annotated bibliography on partial evaluation and mixed computation

0 signed · 84 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-08353-7_128openalex-snapshot
Correctness of mixed computation in ALGOL-like programs
inferredcites →https://doi.org/10.1007/3-540-10003-2_105openalex-snapshot
The use of metasystem transition in theorem proving and program optimization
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-10856-4_71openalex-snapshot
The transformational machine: Theme and variations
inferredcites →https://doi.org/10.1007/3-540-11494-7_8openalex-snapshot
From abstract model to efficient compilation of patterns
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-16042-6_6openalex-snapshot
Program simplification via symbolic interpretation
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/3-540-16446-4_15openalex-snapshot
Program transformation by supercompilation
inferredcites →https://doi.org/10.1007/3-540-16446-4_9openalex-snapshot
A relational framework for abstract interpretation
inferredcites →https://doi.org/10.1007/3-540-16470-7_5openalex-snapshot
Partial computation with a dataflow machine
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_82openalex-snapshot
Compiling OR-parallelism into AND-parallelism
inferredcites →https://doi.org/10.1007/3-540-16492-8_92openalex-snapshot
Qualified answers and their application to transformation
inferredcites →https://doi.org/10.1007/3-540-19027-9_16openalex-snapshot
New insights into partial evaluation: the SCHISM experiment
inferredcites →https://doi.org/10.1007/3-540-50940-2_29openalex-snapshot
A self-applicable partial evaluator for term rewriting systems
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_3openalex-snapshot
On Mixed Computation: Informal Account of the Strict and Polyvariant Computational Schemes
inferredcites →https://doi.org/10.1007/978-3-662-01089-1_3openalex-snapshot
Static-Scope-LISP: Zerlegung Eines Interpretierers in Übersetzer und Laufzeitsystem
inferredcites →https://doi.org/10.1007/bf00271642openalex-snapshot
Polyvariant mixed computation for analyzer programs
inferredcites →https://doi.org/10.1007/bf00288559openalex-snapshot
Statistische Eigenschaften der Neuronaktivität im ascendierenden visuellen System
inferredcites →https://doi.org/10.1007/bf00288817openalex-snapshot
Beitrag zu einer regeltheoretischen Analyse der Pupillenreflexdynamik
inferredcites →https://doi.org/10.1007/bf00288902openalex-snapshot
A memory storage model utilizing spatial correlation functions
inferredcites →https://doi.org/10.1007/bf01069522openalex-snapshot
Denotational semantics of mixed computation processes for a structural programming language
inferredcites →https://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
inferredcites →https://doi.org/10.1007/bf03037133openalex-snapshot
A self-applicable partial evaluator and its use in incremental compilation
inferredcites →https://doi.org/10.1007/bf03037134openalex-snapshot
Mixed computation of Prolog programs
inferredcites →https://doi.org/10.1007/bf03037135openalex-snapshot
Unfolding rules for GHC programs
inferredcites →https://doi.org/10.1007/bf03037136openalex-snapshot
Specialisation of Prolog and FCP programs using abstract interpretation
inferredcites →https://doi.org/10.1007/bf03037137openalex-snapshot
Partial evaluation with inference rules
inferredcites →https://doi.org/10.1007/bf03037138openalex-snapshot
Composing recursive logic programs withClausal join
inferredcites →https://doi.org/10.1007/bf03037139openalex-snapshot
Partial evaluation of metaprograms in a “multiple worlds” logic language
inferredcites →https://doi.org/10.1007/bf03037140openalex-snapshot
Partial evaluation of queries in deductive databases
inferredcites →https://doi.org/10.1007/bf03037141openalex-snapshot
Competitive partial evaluation
inferredcites →https://doi.org/10.1007/bf03037142openalex-snapshot
A partial evaluation system for Prolog: some practical considerations
inferredcites →https://doi.org/10.1007/bfb0000060openalex-snapshot
Automatic construction of special purpose programs
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(77)90078-3openalex-snapshot
On the partial computation principle
inferredcites →https://doi.org/10.1016/0096-0551(85)90004-9openalex-snapshot
Deriving a compiler from an operational semantics written in VDL
inferredcites →https://doi.org/10.1016/0167-6423(87)90031-1openalex-snapshot
Symbolic evaluation with structural recursive symbolic constants
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/0304-3975(86)90173-8openalex-snapshot
Partial evaluation and ω-completeness of algebraic specifications
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1016/b978-0-08-024206-4.50008-0openalex-snapshot
Microprocessor Programming
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.1016/s0020-0190(80)90084-8openalex-snapshot
On the generation of compilers from language definitions
inferredcites →https://doi.org/10.1016/s0065-2458(08)60698-1openalex-snapshot
Incremental Computation
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.1109/tse.1985.232527openalex-snapshot
Symbolic Semantics and Program Reduction
inferredcites →https://doi.org/10.1145/512644.512652openalex-snapshot
Compilers and staging transformations
inferredcites →https://doi.org/10.1145/512644.512672openalex-snapshot
Data flow analysis of applicative programs using minimal function graphs
inferredcites →https://doi.org/10.1145/512760.512781openalex-snapshot
A partial evaluator, and its use for compiling iterative statements in LISP
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/5956.5957openalex-snapshot
The concept of a supercompiler
inferredcites →https://doi.org/10.1145/800068.802134openalex-snapshot
Experiments with a supercompiler
inferredcites →https://doi.org/10.1145/800087.802808openalex-snapshot
On compiling embedded languages in LISP
inferredcites →https://doi.org/10.1145/954063.954069openalex-snapshot
A supercompiler system based on the language REFAL
inferredcites →https://doi.org/10.1609/aimag.v5i1.425openalex-snapshot
Partial Evaluation, Programming Methodology, and Artificial Intelligence
inferredcites →https://doi.org/10.2307/2003282openalex-snapshot
The Programming Language LISP: Its Operation and Applications

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-54444-5_109openalex-snapshot
A technique for recursive invariance detection and selective program specialization
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_11openalex-snapshot
Partial deduction of disjunctive logic programs: A declarative approach
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_13openalex-snapshot
Applications of Unfolding in Prolog 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/bf03037167openalex-snapshot
The derivation of an algorithm for program specialisation
inferred← citeshttps://doi.org/10.1007/bf03038271openalex-snapshot
Mixtus: An automatic partial evaluator for full Prolog
inferred← citeshttps://doi.org/10.1007/bf03038308openalex-snapshot
Partial deduction of logic programs wrt well-founded semantics
inferred← citeshttps://doi.org/10.1007/s11241-005-4683-4openalex-snapshot
Code Analysis for Temporal Predictability
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90021-8openalex-snapshot
Unfold⧸fold transformation of general logic programs for the well-founded semantics
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00120-3openalex-snapshot
Partial deduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1145/1108970.1108973openalex-snapshot
Termination analysis and specialization-point insertion in offline partial evaluation
inferred← citeshttps://doi.org/10.1145/113445.113454openalex-snapshot
Parameterized partial evaluation
inferred← citeshttps://doi.org/10.1145/169683.174155openalex-snapshot
Parameterized partial evaluation
inferred← citeshttps://doi.org/10.1145/177492.177750openalex-snapshot
Lazy and incremental program generation
inferred← citeshttps://doi.org/10.1145/224056.224080openalex-snapshot
Optimistic incremental specialization
inferred← citeshttps://doi.org/10.1145/224057.224080openalex-snapshot
Optimistic incremental specialization
inferred← citeshttps://doi.org/10.1145/231379.231409openalex-snapshot
Fast, effective dynamic compilation
inferred← citeshttps://doi.org/10.1145/243439.243447openalex-snapshot
An introduction to partial evaluation
inferred← citeshttps://doi.org/10.1145/249069.231409openalex-snapshot
Fast, effective dynamic compilation
inferred← citeshttps://doi.org/10.1145/3635800.3637445openalex-snapshot
The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution)
inferred← citeshttps://doi.org/10.1145/377769.377778openalex-snapshot
Specialization tools and techniques for systematic optimization of system software
inferred← citeshttps://doi.org/10.1145/65738.65739openalex-snapshot
Partial computation as a practical aid in the compiler construction course
inferred← citeshttps://doi.org/10.6083/c247ds452openalex-snapshot
A toolkit for specializing production operating system code
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.