On the public citation graph
A unified framework for binding-time analysis
0 signed · 43 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.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-58201-0_85openalex-snapshot
Least solutions of equations over N
inferredcites →https://doi.org/10.1007/3-540-60360-3_36openalex-snapshot
Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time
inferredcites →https://doi.org/10.1007/3-540-60360-3_40openalex-snapshot
Control-flow analysis and type systems
inferredcites →https://doi.org/10.1007/3-540-61580-6_17openalex-snapshot
Multi-Level Lambda-Calculi: An algebraic description
inferredcites →https://doi.org/10.1007/3540543961_22openalex-snapshot
Efficient type inference for higher-order binding-time analysis
inferredcites →https://doi.org/10.1007/bf01019003openalex-snapshot
Binding-time analysis for Standard ML
inferredcites →https://doi.org/10.1007/bf01019004openalex-snapshot
The essence of eta-expansion in partial evaluation
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/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1017/cbo9780511526572openalex-snapshot
Two-Level Functional Languages
inferredcites →https://doi.org/10.1017/cbo9780511569814openalex-snapshot
Projection Factorisations in Partial Evaluation
inferredcites →https://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferredcites →https://doi.org/10.1017/s0956796800000769openalex-snapshot
Efficient analyses for realistic off-line partial evaluation
inferredcites →https://doi.org/10.1017/s0960129500000359openalex-snapshot
Recognizable sets of graphs: equivalent definitions and closure properties
inferredcites →https://doi.org/10.1017/s0960129500000505openalex-snapshot
Simulating expansions without expansions
inferredcites →https://doi.org/10.1109/iccl.1994.288372openalex-snapshot
Binding-time analysis: abstract interpretation versus type inference
inferredcites →https://doi.org/10.1145/154630.154638openalex-snapshot
Polyvariant binding-time analysis for applicative languages
inferredcites →https://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferredcites →https://doi.org/10.1145/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/199448.199533openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/210184.210187openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferredcites →https://doi.org/10.1145/91556.91668openalex-snapshot
Binding time analysis for high order untyped functional languages
inferredcites →https://doi.org/10.1145/91556.91672openalex-snapshot
Partial type inference for untyped functional programs
inferredcites →https://doi.org/10.7146/brics.v2i41.21673openalex-snapshot
Eta-Expansion Does The Trick
inferredcites →https://doi.org/10.7146/dpb.v24i498.7026openalex-snapshot
Annotated Type Systems for Program Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10705424_4openalex-snapshot
Partial Evaluation and Non-interference for Object Calculi
inferred← citeshttps://doi.org/10.1007/3-540-44898-5_21openalex-snapshot
Continuation-Based Partial Evaluation without Continuations
inferred← citeshttps://doi.org/10.1007/3-540-45821-2_1openalex-snapshot
Program Generation, Termination, and Binding-Time Analysis
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_15openalex-snapshot
Two Flavors of Offine Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_15openalex-snapshot
A Dependent Dependency Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80148-3openalex-snapshot
Correctness of a Region-Based Binding-Time Analysis
inferred← citeshttps://doi.org/10.1145/1011508.1011510openalex-snapshot
Polymorphic specialization for ML
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/581478.581505openalex-snapshot
Program generation, termination, and binding-time analysis
inferred← citeshttps://doi.org/10.4204/eptcs.413.1openalex-snapshot
Inversion by Partial Evaluation: A Reversible Interpreter Experiment
inferred← citeshttps://doi.org/10.5555/1760267.1760297openalex-snapshot
Continuation-based partial evaluation without continuations
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.