On the public citation graph

Partial evaluation, self-application and types

https://doi.org/10.1007/bfb0032064
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.
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/3-540-52592-0_56openalex-snapshot
Automatic autoprojection of higher order recursive equations
inferredcites →https://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
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/0167-6423(91)90002-fopenalex-snapshot
Automatic autoprojection of recursive equations with global variables and abstract data types
inferredcites →https://doi.org/10.1016/0167-6423(91)90035-vopenalex-snapshot
Automatic autoprojection of higher order recursive equations
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/s0747-7171(89)80066-5openalex-snapshot
Meta-circular interpreter for a strongly typed language
inferredcites →https://doi.org/10.1109/iccl.1990.63760openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferredcites →https://doi.org/10.1145/318593.318661openalex-snapshot
Semantics-directed code generation
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/358141.358144openalex-snapshot
An overview of computational complexity
inferredcites →https://doi.org/10.1145/512927.512941openalex-snapshot
Advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1145/582153.582178openalex-snapshot
A semantics-directed compiler generator
inferredcites →https://doi.org/10.1145/5956.5957openalex-snapshot
The concept of a supercompiler
inferredcites →https://doi.org/10.1145/73560.73569openalex-snapshot
Automatic binding time analysis for a typed λ-calculus
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

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-7openalex-snapshot
The essence of computation: complexity, analysis, transformation
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_4openalex-snapshot
Lambda Calculi and Linear Speedups
inferred← citeshttps://doi.org/10.1007/3-540-45142-0_7openalex-snapshot
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_11openalex-snapshot
Specialising Interpreters Using Offline Partial Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_16openalex-snapshot
The Translation Power of the Futamura Projections
inferred← citeshttps://doi.org/10.1007/978-94-015-1233-6_2openalex-snapshot
T
inferred← citeshttps://doi.org/10.1007/bfb0024661openalex-snapshot
Verification tools in the development of provably correct compilers
inferred← citeshttps://doi.org/10.1007/s10990-008-9030-8openalex-snapshot
Efficient and flexible access control via Jones-optimal logic program specialisation
inferred← citeshttps://doi.org/10.1007/s10990-008-9033-5openalex-snapshot
An investigation of Jones optimality and BTI-universal specializers
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.062openalex-snapshot
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
inferred← citeshttps://doi.org/10.1017/s0956796800001167openalex-snapshot
On the generation of specializers
inferred← citeshttps://doi.org/10.1017/s0956796800001453openalex-snapshot
On-line and off-line partial evaluation: semantic specifications and correctness proofs
inferred← citeshttps://doi.org/10.1109/icse.1998.671133openalex-snapshot
Reifying configuration management for object-oriented software
inferred← citeshttps://doi.org/10.1145/1014007.1014026openalex-snapshot
Efficient and flexible access control via logic program specialisation
inferred← citeshttps://doi.org/10.1145/115865.115900openalex-snapshot
Towards multiple self-application
inferred← citeshttps://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferred← citeshttps://doi.org/10.1145/3729259openalex-snapshot
Partial Evaluation, Whole-Program Compilation
inferred← citeshttps://doi.org/10.1145/568173.568175openalex-snapshot
Jones optimality, binding-time improvements, and the strength of program specializers
inferred← citeshttps://doi.org/10.4204/eptcs.296.3openalex-snapshot
Challenges in the Specialisation of Smart Horn Clause Interpreters
inferred← citeshttps://doi.org/10.4995/thesis/10251/130206openalex-snapshot
Partial Evaluation of Rewriting Logic Theories
inferred← citeshttps://doi.org/10.5555/302163.302187openalex-snapshot
Reifying configuration management for object-oriented software
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.