On the public citation graph
Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl)
0 signed · 63 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/11431664_4openalex-snapshot
A Rational Deconstruction of Landin’s SECD Machine
inferredcites →https://doi.org/10.1007/3-540-10843-2_10openalex-snapshot
Flow analysis of lambda expressions
inferredcites →https://doi.org/10.1007/3-540-15975-4_33openalex-snapshot
How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages
inferredcites →https://doi.org/10.1007/3-540-36579-6_6openalex-snapshot
A New One-Pass Transformation into Monadic Normal Form
inferredcites →https://doi.org/10.1007/3-540-46425-5_4openalex-snapshot
Flow-Directed Closure Conversion for Typed Languages
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_30openalex-snapshot
CFA2: A Context-Free Approach to Control-Flow Analysis
inferredcites →https://doi.org/10.1007/s10990-006-8611-7openalex-snapshot
Polymorphic typed defunctionalization and concretization
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/j.ipl.2004.02.012openalex-snapshot
A functional correspondence between call-by-need evaluators and lazy abstract machines
inferredcites →https://doi.org/10.1016/j.ipl.2007.10.010openalex-snapshot
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
inferredcites →https://doi.org/10.1016/j.scico.2007.10.007openalex-snapshot
Refunctionalization at work
inferredcites →https://doi.org/10.1016/j.tcs.2005.06.008openalex-snapshot
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
inferredcites →https://doi.org/10.1017/s0956796812000238openalex-snapshot
Systematic abstraction of abstract machines
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1023/a:1010027404223openalex-snapshot
Definitional Interpreters for Higher-Order Programming Languages
inferredcites →https://doi.org/10.1145/115865.115884openalex-snapshot
The semantics of Scheme control-flow analysis
inferredcites →https://doi.org/10.1145/1190216.1190241openalex-snapshot
Lightweight fusion by fixed point promotion
inferredcites →https://doi.org/10.1145/1411203.1411206openalex-snapshot
Defunctionalized interpreters for programming languages
inferredcites →https://doi.org/10.1145/1411204.1411206openalex-snapshot
Defunctionalized interpreters for programming languages
inferredcites →https://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/1596550.1596596openalex-snapshot
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
inferredcites →https://doi.org/10.1145/1806596.1806631openalex-snapshot
Resolving and exploiting the k -CFA paradox
inferredcites →https://doi.org/10.1145/1863543.1863553openalex-snapshot
Abstracting abstract machines
inferredcites →https://doi.org/10.1145/2364527.2364576openalex-snapshot
Introspective pushdown analysis of higher-order programs
inferredcites →https://doi.org/10.1145/2384616.2384655openalex-snapshot
Higher-order symbolic execution via contracts
inferredcites →https://doi.org/10.1145/2491956.2491979openalex-snapshot
Monadic abstract interpreters
inferredcites →https://doi.org/10.1145/2633357.2633361openalex-snapshot
Promoting functions to type families in Haskell
inferredcites →https://doi.org/10.1145/2837614.2837631openalex-snapshot
Pushdown control-flow analysis for free
inferredcites →https://doi.org/10.1145/2951913.2951936openalex-snapshot
Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis
inferredcites →https://doi.org/10.1145/3110256openalex-snapshot
Abstracting definitional interpreters (functional pearl)
inferredcites →https://doi.org/10.1145/365230.365257openalex-snapshot
The next 700 programming languages
inferredcites →https://doi.org/10.1145/367177.367199openalex-snapshot
Recursive functions of symbolic expressions and their computation by machine, Part I
inferredcites →https://doi.org/10.1145/41625.41654openalex-snapshot
A calculus for assignments in higher-order languages
inferredcites →https://doi.org/10.1145/888251.888254openalex-snapshot
A functional correspondence between evaluators and abstract machines
inferredcites →https://doi.org/10.13016/m2j96097dopenalex-snapshot
Mechanizing Abstract Interpretation
inferredcites →https://doi.org/10.2298/csis130923030fopenalex-snapshot
Modular polymorphic defunctionalization
inferredcites →https://doi.org/10.48550/arxiv.1007.4268openalex-snapshot
Pushdown Control-Flow Analysis of Higher-Order Programs
inferredcites →https://doi.org/10.7146/brics.v10i13.21783openalex-snapshot
A Functional Correspondence between Evaluators and Abstract Machines
inferredcites →https://doi.org/10.7146/brics.v10i41.21809openalex-snapshot
An Operational Foundation for Delimited Continuations
inferredcites →https://doi.org/10.7146/brics.v11i26.21851openalex-snapshot
Refocusing in Reduction Semantics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_11openalex-snapshot
Demand Control-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_8openalex-snapshot
Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap
inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_5openalex-snapshot
Full Control-Flow Sensitivity for Definitional Interpreters
inferred← citeshttps://doi.org/10.1145/3360552openalex-snapshot
Staged abstract interpreters: fast and modular whole-program analysis via meta-programming
inferred← citeshttps://doi.org/10.1145/3428232openalex-snapshot
Compiling symbolic execution with staging and algebraic effects
inferred← citeshttps://doi.org/10.1145/3473601openalex-snapshot
Newly-single and loving it: improving higher-order must-alias analysis with heap fragments
inferred← citeshttps://doi.org/10.1145/3547648openalex-snapshot
Automatically deriving control-flow graph generators from operational semantics
inferred← citeshttps://doi.org/10.1145/3747516openalex-snapshot
Environment-Sharing Analysis and Caller-Provided Environments for Higher-Order Languages
inferred← citeshttps://doi.org/10.1145/3747539openalex-snapshot
Call-Guarded Abstract Definitional Interpreters
inferred← citeshttps://doi.org/10.1145/3759427.3760368openalex-snapshot
On the Structure of Abstract Interpreters
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.