On the public citation graph
Call-by-need and continuation-passing style
0 signed · 57 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.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferredcites →https://doi.org/10.1007/3-540-09981-6_19openalex-snapshot
The theory and practice of transforming call-by-need into call-by-value
inferredcites →https://doi.org/10.1007/3-540-15975-4_37openalex-snapshot
Lambda lifting: Transforming programs to recursive equations
inferredcites →https://doi.org/10.1007/3-540-18317-5_22openalex-snapshot
Detecting sharing of partial applications in functional programs
inferredcites →https://doi.org/10.1007/bf01806169openalex-snapshot
Code optimizations for lazy evaluation
inferredcites →https://doi.org/10.1007/bfb0021415openalex-snapshot
Design and Implementation of Programming Languages
inferredcites →https://doi.org/10.1007/bfb0024188openalex-snapshot
Integrating strict and lazy evaluation: the λsl-calculus
inferredcites →https://doi.org/10.1016/0020-0190(90)90112-bopenalex-snapshot
Obtaining lazy evaluation with continuations in scheme
inferredcites →https://doi.org/10.1016/0020-0190(90)90165-topenalex-snapshot
A short proof of the lexical addressing algorithm
inferredcites →https://doi.org/10.1016/0167-6423(86)90010-9openalex-snapshot
Strictness analysis for higher-order functions
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(86)90006-xopenalex-snapshot
Two-level semantics and code generation
inferredcites →https://doi.org/10.1016/0304-3975(89)90122-9openalex-snapshot
The semantics of lazy functional languages
inferredcites →https://doi.org/10.1017/s0956796800000319openalex-snapshot
Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1145/128861.128867openalex-snapshot
Cache behavior of combinator graph reduction
inferredcites →https://doi.org/10.1145/13310.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/143165.143220openalex-snapshot
Generating a compiler for a lazy language by partial evaluation
inferredcites →https://doi.org/10.1145/151640.151641openalex-snapshot
CPS-transformation after strictness analysis
inferredcites →https://doi.org/10.1145/158511.158614openalex-snapshot
Specifying the correctness of binding-time analysis
inferredcites →https://doi.org/10.1145/75277.75303openalex-snapshot
Continuation-passing, closure-passing style
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
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-59200-8_54openalex-snapshot
Lazy rewriting and eager machinery
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_9openalex-snapshot
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_15openalex-snapshot
Realizability Interpretation and Normalization of Typed Call-by-Need $$\lambda $$-calculus with Control
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_6openalex-snapshot
Classical Call-by-Need and Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_6openalex-snapshot
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts
inferred← citeshttps://doi.org/10.1007/bfb0052377openalex-snapshot
Higher-order rewriting and partial evaluation
inferred← citeshttps://doi.org/10.1017/s0956796809990219openalex-snapshot
Small-step and big-step semantics for call-by-need
inferred← citeshttps://doi.org/10.1017/s0956796897002724openalex-snapshot
The call-by-need lambda calculus
inferred← citeshttps://doi.org/10.1017/s0956796898003141openalex-snapshot
Classical logic, continuation semantics and abstract machines
inferred← citeshttps://doi.org/10.1109/lics.2012.47openalex-snapshot
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
inferred← citeshttps://doi.org/10.1145/1480881.1480903openalex-snapshot
Lazy evaluation and delimited control
inferred← citeshttps://doi.org/10.1145/1594834.1480903openalex-snapshot
Lazy evaluation and delimited control
inferred← citeshttps://doi.org/10.1145/2643135.2643155openalex-snapshot
Continuations, Processes, and Sharing
inferred← citeshttps://doi.org/10.1145/2951913.2951931openalex-snapshot
Sequent calculus as a compiler intermediate language
inferred← citeshttps://doi.org/10.1145/3022670.2951931openalex-snapshot
Sequent calculus as a compiler intermediate language
inferred← citeshttps://doi.org/10.1145/3062341.3062380openalex-snapshot
Compiling without continuations
inferred← citeshttps://doi.org/10.1145/3140587.3062380openalex-snapshot
Compiling without continuations
inferred← citeshttps://doi.org/10.1145/3341643openalex-snapshot
Compiling with continuations, or without? whatever.
inferred← citeshttps://doi.org/10.1145/3373718.3394792openalex-snapshot
A calculus of expandable stores
inferred← citeshttps://doi.org/10.1145/345099.345102openalex-snapshot
Lazy rewriting on eager machinery
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:1)2010openalex-snapshot
Lazy Evaluation and Delimited Control
inferred← citeshttps://doi.org/10.2307/j.ctv36xvmkd.9openalex-snapshot
On Graph Rewriting, Reduction and Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07616openalex-snapshot
A constructive proof of dependent choice in classical arithmetic via memoization
inferred← citeshttps://doi.org/10.5445/ir/43596openalex-snapshot
Separating weakening and contraction in a linear lambda calculus
inferred← citeshttps://doi.org/10.70675/e6654da0zbd5ez4eb1z9a61z3a679c1fbb38openalex-snapshot
On the lambda calculus with constructors
inferred← citeshttps://doi.org/10.7146/aul.214.152openalex-snapshot
An Analytical Approach to Programs as Data Objects
inferred← citeshttps://doi.org/10.7146/brics.v3i19.19981openalex-snapshot
Thunks and the lambda-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v4i46.19267openalex-snapshot
Higher-Order Rewriting and Partial Evaluation
inferred← citeshttps://doi.org/10.7146/brics.v4i7.18797openalex-snapshot
Thunks and the lambda-Calculus (Extended Version)
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.