On the public citation graph

Handling delimited continuations with dependent types

https://doi.org/10.1145/3236764
0 signed · 56 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.1006/inco.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1007/11417170_16openalex-snapshot
On the Degeneracy of Σ-Types in Presence of Computational Classical Logic
inferredcites →https://doi.org/10.1007/3-540-48168-0_32openalex-snapshot
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
inferredcites →https://doi.org/10.1007/3-540-52335-9_47openalex-snapshot
Inductively defined types
inferredcites →https://doi.org/10.1007/3-540-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferredcites →https://doi.org/10.1007/978-3-540-76637-7_16openalex-snapshot
Polymorphic Delimited Continuations
inferredcites →https://doi.org/10.1007/978-3-540-87827-8_28openalex-snapshot
The Four Colour Theorem: Engineering of a Formal Proof
inferredcites →https://doi.org/10.1007/978-3-642-29822-6_21openalex-snapshot
A Call-by-Name CPS Hierarchy
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_19openalex-snapshot
A Classical Realizability Model for a Semantical Value Restriction
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1007/s10990-007-9006-0openalex-snapshot
A type-theoretic foundation of delimited continuations
inferredcites →https://doi.org/10.1007/s10990-007-9008-yopenalex-snapshot
Implementation and use of the PLT scheme Web server
inferredcites →https://doi.org/10.1007/s10990-007-9010-4openalex-snapshot
A static simulation of dynamic delimited control
inferredcites →https://doi.org/10.1016/j.apal.2011.12.008openalex-snapshot
Delimited control operators prove Double-negation Shift
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1023/a:1010000206149openalex-snapshot
CPS Translations and Applications: The Cube and Beyond
inferredcites →https://doi.org/10.1109/lics.2010.23openalex-snapshot
Polarity and the Logic of Delimited Continuations
inferredcites →https://doi.org/10.1109/lics.2012.47openalex-snapshot
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
inferredcites →https://doi.org/10.1145/1111037.1111042openalex-snapshot
Formal certification of a compiler back-end or
inferredcites →https://doi.org/10.1145/1159803.1159808openalex-snapshot
Delimited dynamic binding
inferredcites →https://doi.org/10.1145/1291151.1291178openalex-snapshot
Adding delimited and composable control to a production programming environment
inferredcites →https://doi.org/10.1145/1328438.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferredcites →https://doi.org/10.1145/1480945.1480962openalex-snapshot
Shifting the stage
inferredcites →https://doi.org/10.1145/1706299.1706333openalex-snapshot
Dependent types and program equivalence
inferredcites →https://doi.org/10.1145/174675.178047openalex-snapshot
Representing monads
inferredcites →https://doi.org/10.1145/2034574.2034786openalex-snapshot
Subtyping delimited continuations
inferredcites →https://doi.org/10.1145/2034574.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/2034574.2034830openalex-snapshot
An equivalence-preserving CPS translation via multi-language semantics
inferredcites →https://doi.org/10.1145/2034773.2034786openalex-snapshot
Subtyping delimited continuations
inferredcites →https://doi.org/10.1145/2034773.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/2034773.2034830openalex-snapshot
An equivalence-preserving CPS translation via multi-language semantics
inferredcites →https://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/3110257openalex-snapshot
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control
inferredcites →https://doi.org/10.1145/3158095openalex-snapshot
Handling fibred algebraic effects
inferredcites →https://doi.org/10.1145/3158110openalex-snapshot
Type-preserving CPS translation of Σ and Π types is not not possible
inferredcites →https://doi.org/10.1145/3162069openalex-snapshot
Selective CPS transformation for shift and reset
inferredcites →https://doi.org/10.1145/357766.351262openalex-snapshot
The duality of computation
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/503032.503043openalex-snapshot
CPS translating inductive and coinductive types
inferredcites →https://doi.org/10.1145/604131.604144openalex-snapshot
From control effects to typed continuation passing
inferredcites →https://doi.org/10.1145/91556.91622openalex-snapshot
Abstracting control
inferredcites →https://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control
inferredcites →https://doi.org/10.1145/99370.99404openalex-snapshot
Theorems for free!
inferredcites →https://doi.org/10.4204/eptcs.285.2openalex-snapshot
Eff Directly in OCaml
inferredcites →https://doi.org/10.48550/arxiv.1706.07997openalex-snapshot
In Search of Effectful Dependent Types
inferredcites →https://doi.org/10.48550/arxiv.1710.02594openalex-snapshot
Fibred Computational Effects

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1017/s0956796822000090openalex-snapshot
ANF preserves dependent types up to extensional equality
inferred← citeshttps://doi.org/10.1017/s0956796824000054openalex-snapshot
Signature Restriction for Polymorphic Algebraic Effects
inferred← citeshttps://doi.org/10.1145/3408999openalex-snapshot
Signature restriction for polymorphic algebraic effects
inferred← citeshttps://doi.org/10.1145/3571264openalex-snapshot
Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations
inferred← citeshttps://doi.org/10.1145/3633280openalex-snapshot
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers
inferred← citeshttps://doi.org/10.1145/3723325.3723341openalex-snapshot
A Mostly CPS, Partly ANF Translation of Dependent Types
inferred← citeshttps://doi.org/10.1145/3759427.3760367openalex-snapshot
Continuations in Music
inferred← citeshttps://doi.org/10.17760/d20316239openalex-snapshot
Compiling with dependent types
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:34)2022openalex-snapshot
A Functional Abstraction of Typed Invocation Contexts
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.