On the public citation graph

Binding-time analysis for both static and dynamic expressions

https://doi.org/10.1007/bf03037258
0 signed · 30 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-47018-2openalex-snapshot
Partial Evaluation. Practice and Theory: DIKU 1998 International Summer School, Copenhagen, Denmark, June 29 - July 10, 1998
inferredcites →https://doi.org/10.1007/3-540-47018-2_2openalex-snapshot
An Introduction to Online and Offline Partial Evaluation Using a Simple Flowchart Language
inferredcites →https://doi.org/10.1007/3-540-48294-6_8openalex-snapshot
Binding-Time Analysis for Both Static and Dynamic Expressions
inferredcites →https://doi.org/10.1007/3-540-61580-6_23openalex-snapshot
Self-applicable online partial evaluation
inferredcites →https://doi.org/10.1007/3540543961_22openalex-snapshot
Efficient type inference for higher-order binding-time analysis
inferredcites →https://doi.org/10.1007/bf01019004openalex-snapshot
The essence of eta-expansion in partial evaluation
inferredcites →https://doi.org/10.1007/bfb0032749openalex-snapshot
Effective specialization of realistic programs via use sensitivity
inferredcites →https://doi.org/10.1007/bfb0055522openalex-snapshot
Determination of dynamic method dispatches using run-time code generation
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.1017/s0956796800000769openalex-snapshot
Efficient analyses for realistic off-line partial evaluation
inferredcites →https://doi.org/10.1023/a:1007763000430openalex-snapshot
inferredcites →https://doi.org/10.1023/a:1010095604496openalex-snapshot
Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/186025.186037openalex-snapshot
Fixpoint computation for polyvariant static analyses of higher-order applicative programs
inferredcites →https://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferredcites →https://doi.org/10.1145/258915.258935openalex-snapshot
Two for the price of one
inferredcites →https://doi.org/10.1145/258916.258935openalex-snapshot
Two for the price of one
inferredcites →https://doi.org/10.1145/258993.258997openalex-snapshot
Partial evaluation of call-by-value λ-calculus with side-effects
inferredcites →https://doi.org/10.1145/91556.91622openalex-snapshot
Abstracting control

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-45699-6_4openalex-snapshot
Normalization and Partial Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-45927-8_17openalex-snapshot
A Prototype Dependency Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_7openalex-snapshot
Binding-Time Analysis for Mercury
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_15openalex-snapshot
Finally Tagless, Partially Evaluated
inferred← citeshttps://doi.org/10.1007/978-3-642-04652-0_3openalex-snapshot
From Reduction-Based to Reduction-Free Normalization
inferred← citeshttps://doi.org/10.1007/b98187openalex-snapshot
Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development
inferred← citeshttps://doi.org/10.1007/bf03037261openalex-snapshot
A portable approach to dynamic optimization in run-time specialization
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.007openalex-snapshot
From Reduction-based to Reduction-free Normalization
inferred← citeshttps://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0042openalex-snapshot
Binding-Time Analysis for Mercury
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.