On the public citation graph
Control delimiters and their hierarchies
0 signed · 95 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/978-3-662-09507-2_12openalex-snapshot
LISP 1.5 Programmer’s Manual
inferredcites →https://doi.org/10.1016/0096-0551(86)90007-xopenalex-snapshot
Obtaining coroutines with continuations
inferredcites →https://doi.org/10.1016/0096-0551(87)90003-8openalex-snapshot
Abstracting timed preemption with engines
inferredcites →https://doi.org/10.1016/0096-0551(89)90018-0openalex-snapshot
Engines from continuations
inferredcites →https://doi.org/10.1093/comjnl/15.2.117openalex-snapshot
OS6--An Experimental Operating System for a Small Computer. Part 1: General Principles and Structure
inferredcites →https://doi.org/10.1145/1164679.1164682openalex-snapshot
An operating system for a small computer
inferredcites →https://doi.org/10.1145/15022.15026openalex-snapshot
On some extensions of syntactic error recovery technique based on phrase markers
inferredcites →https://doi.org/10.1145/15042.15043openalex-snapshot
Revised 3 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/29873.30392openalex-snapshot
Embedding continuations in procedural objects
inferredcites →https://doi.org/10.1145/362349.362364openalex-snapshot
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
inferredcites →https://doi.org/10.1145/365230.365257openalex-snapshot
The next 700 programming languages
inferredcites →https://doi.org/10.1145/41625.41654openalex-snapshot
A calculus for assignments in higher-order languages
inferredcites →https://doi.org/10.1145/62678.62684openalex-snapshot
Abstract continuations: a mathematical semantics for handling full jumps
inferredcites →https://doi.org/10.1145/73560.73574openalex-snapshot
Stores and partial continuations as first-class objects in a language and its environment
inferredcites →https://doi.org/10.1145/73560.73576openalex-snapshot
The theory and practice of first-class prompts
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-46425-5_16openalex-snapshot
Sharing Continuations: Proofnets for Languages with Explicit Control
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_15openalex-snapshot
An Operational Investigation of the CPS Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_14openalex-snapshot
Partial continuations as the difference of continuations a duumvirate of control operators
inferred← citeshttps://doi.org/10.1007/978-3-540-74255-5_22openalex-snapshot
Delimited Continuations in Operating Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14888-0_16openalex-snapshot
Representing Covert Movements by Delimited Continuations
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_14openalex-snapshot
Constraining Delimited Control with Contracts
inferred← citeshttps://doi.org/10.1007/978-3-642-74564-5_5openalex-snapshot
Continuations in Natural Language
inferred← citeshttps://doi.org/10.1007/bfb0024149openalex-snapshot
New ideas in parallel lisp: Language design, implementation, and programming tools
inferred← citeshttps://doi.org/10.1007/bfb0030637openalex-snapshot
A syntactic theory of dynamic binding
inferred← citeshttps://doi.org/10.1007/s10988-005-6580-7openalex-snapshot
Explaining Crossover and Superiority as Left-to-right Evaluation
inferred← citeshttps://doi.org/10.1007/s10990-007-9006-0openalex-snapshot
A type-theoretic foundation of delimited continuations
inferred← citeshttps://doi.org/10.1007/s10990-007-9010-4openalex-snapshot
A static simulation of dynamic delimited control
inferred← citeshttps://doi.org/10.1016/j.scico.2013.04.010openalex-snapshot
On the semantics of parsing actions
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.028openalex-snapshot
A syntactic correspondence between context-sensitive calculi and abstract machines
inferred← citeshttps://doi.org/10.1017/s0956796807006259openalex-snapshot
A monadic framework for delimited continuations
inferred← citeshttps://doi.org/10.1017/s0956796813000312openalex-snapshot
Delimited control and computational effects
inferred← citeshttps://doi.org/10.1017/s0956796820000027openalex-snapshot
Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala
inferred← citeshttps://doi.org/10.1023/a:1010087314987openalex-snapshot
A Syntactic Theory of Dynamic Binding
inferred← citeshttps://doi.org/10.1093/oso/9780199204373.003.0004openalex-snapshot
Linguistic Side Effects
inferred← citeshttps://doi.org/10.1109/lics.1991.151634openalex-snapshot
An evaluation semantics for classical proofs
inferred← citeshttps://doi.org/10.1145/1016848.1016860openalex-snapshot
A type-theoretic foundation of continuations and prompts
inferred← citeshttps://doi.org/10.1145/1016850.1016860openalex-snapshot
A type-theoretic foundation of continuations and prompts
inferred← citeshttps://doi.org/10.1145/1291151.1291178openalex-snapshot
Adding delimited and composable control to a production programming environment
inferred← citeshttps://doi.org/10.1145/1291220.1291178openalex-snapshot
Adding delimited and composable control to a production programming environment
inferred← citeshttps://doi.org/10.1145/181889.181891openalex-snapshot
A library of high level control operators
inferred← citeshttps://doi.org/10.1145/182409.182483openalex-snapshot
Continuation-based partial evaluation
inferred← citeshttps://doi.org/10.1145/182590.182483openalex-snapshot
Continuation-based partial evaluation
inferred← citeshttps://doi.org/10.1145/2034574.2034783openalex-snapshot
Modular rollback through control logging
inferred← citeshttps://doi.org/10.1145/2034773.2034783openalex-snapshot
Modular rollback through control logging
inferred← citeshttps://doi.org/10.1145/224164.224173openalex-snapshot
A generalization of exceptions and control in ML-like languages
inferred← citeshttps://doi.org/10.1145/225058.225090openalex-snapshot
Persistent lists with catenation via recursive slow-down
inferred← citeshttps://doi.org/10.1145/2370776.2370789openalex-snapshot
Functional semantics of parsing actions, and left recursion elimination as continuation passing
inferred← citeshttps://doi.org/10.1145/237814.237865openalex-snapshot
Purely functional representations of catenable sorted lists
inferred← citeshttps://doi.org/10.1145/2794078openalex-snapshot
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
inferred← citeshttps://doi.org/10.1145/290229.290234openalex-snapshot
Revised 5 report on the algorithmic language scheme
inferred← citeshttps://doi.org/10.1145/3192366.3192370openalex-snapshot
Putting in all the stops: execution control for JavaScript
inferred← citeshttps://doi.org/10.1145/324133.324139openalex-snapshot
Purely functional, real-time deques with catenation
inferred← citeshttps://doi.org/10.1145/3296979.3192370openalex-snapshot
Putting in all the stops: execution control for JavaScript
inferred← citeshttps://doi.org/10.1145/3426422.3426978openalex-snapshot
Wasm/k: delimited continuations for WebAssembly
inferred← citeshttps://doi.org/10.1145/3546746openalex-snapshot
Interacting with Rigid and Soft Surfaces for Smart-Home Control
inferred← citeshttps://doi.org/10.1145/3571233openalex-snapshot
Tail Recursion Modulo Context: An Equational Approach
inferred← citeshttps://doi.org/10.1145/3586050openalex-snapshot
Exact Recursive Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/382130.382133openalex-snapshot
Revised 4 report on the algorithmic language scheme
inferred← citeshttps://doi.org/10.1145/91556.91626openalex-snapshot
Reasoning with continuations II: full abstraction for models of control
inferred← citeshttps://doi.org/10.1145/99583.99610openalex-snapshot
A dynamic extent control operator for partial continuations
inferred← citeshttps://doi.org/10.1145/99583.99611openalex-snapshot
Models of continuations without continuations
inferred← citeshttps://doi.org/10.1184/r1/6591038openalex-snapshot
A modal calculus for effect handling
inferred← citeshttps://doi.org/10.2168/lmcs-1(2:5)2005openalex-snapshot
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
inferred← citeshttps://doi.org/10.3233/fi-2017-1534openalex-snapshot
Concurrency Semantics in Continuation-Passing Style
inferred← citeshttps://doi.org/10.4204/eptcs.212.5openalex-snapshot
A Modular Structural Operational Semantics for Delimited Continuations
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.292openalex-snapshot
The Lax Braided Structure of Streaming I/O
inferred← citeshttps://doi.org/10.4230/lipics.ecoop.2020.23openalex-snapshot
Lifting Sequential Effects to Control Operators
inferred← citeshttps://doi.org/10.5555/365411.365528openalex-snapshot
Making data structures confluently persistent
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.v10i41.21809openalex-snapshot
An Operational Foundation for Delimited Continuations
inferred← citeshttps://doi.org/10.7146/brics.v11i29.21854openalex-snapshot
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
inferred← citeshttps://doi.org/10.7146/brics.v12i11.21877openalex-snapshot
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
inferred← citeshttps://doi.org/10.7146/brics.v12i16.21882openalex-snapshot
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
inferred← citeshttps://doi.org/10.7146/brics.v12i22.21888openalex-snapshot
A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines
inferred← citeshttps://doi.org/10.7146/brics.v12i24.21890openalex-snapshot
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
inferred← citeshttps://doi.org/10.7146/brics.v12i38.21905openalex-snapshot
A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines
inferred← citeshttps://doi.org/10.7146/brics.v13i15.21920openalex-snapshot
A Dynamic Continuation-Passing Style for Dynamic Delimited 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.