CPS Semantics for Effect Handlers

• CPS Semantics for Effect Handlers is a framework that transforms effectful computations into explicit higher-order functions by reifying continuations and effect handlers.
• It modularizes algebraic effects by decoupling effectful operations from their interpretations and integrates advanced type systems like ATM and ARM.
• The approach ensures rigorous meta-theoretic guarantees, such as type preservation and operational simulation, which support formal verification of effectful programs.

Continuation-Passing Style (CPS) semantics for effect handlers provide a mathematically rigorous method for representing and reasoning about algebraic effects and their handlers in modern functional programming languages. Effect handlers modularize complex control-flow abstractions by isolating effectful operations from their interpretation, enabling fine-grained manipulation of control and data flow. CPS semantics make the continuation structure explicit, systematically encoding control effects and the dynamic scope of handlers within higher-order, pure functional constructs. Recent advances have refined this approach to support not only effectful computation but also expressive type systems—including answer type modification (ATM) and answer refinement modification (ARM)—and complete connections with categorical and equational semantics.

1. Algebraic Effects and Handlers: Source Language Foundations

Algebraic effect handlers enable structured programming with operations (such as state, exceptions, nondeterminism) and modular, composable handlers. The core language distinguishes value terms ($v$), computations ($c$), and handlers ($h$), typically defined as: $$\begin{aligned} v &::= x \mid p \mid \lambda x.\,c \mid \mathsf{rec}\;f(x).\;c \ c &::= \mathsf{return}\;v \mid v_1\,v_2 \mid \mathsf{if}\;v\,\mathsf{then}\;c_1\,\mathsf{else}\;c_2 \mid \mathsf{let}\;x = c_1\,\mathsf{in}\;c_2 \mid \mathit{op}\;v \mid \mathsf{with}\;h\,\mathsf{handle}\;c \ h &::= \{\;\mathsf{return}\;x_r \mapsto c_r;\; \overline{\mathit{op}_i(x_i, k_i) \mapsto c_i} \;\} \end{aligned}$$ Operation calls capture delimited continuations up to the nearest enclosing handler.

Effect signatures ($\Sigma$) assign each operation a type, e.g., $\op: (x:T_{in}) \to ((y:T_{out}) \to C_1) \to C_2$. The type system accommodates refinements: $$\begin{aligned} T &::= \{x:B \mid \phi(x)\} \mid (x:T) \to C \ C &::= \mathsf{Comp}\langle \Sigma,\;T,\;S \rangle \end{aligned}$$ where $S$ is a control effect: either pure ($\square$) or impure ($\tyctl{x}{C_1}{C_2}$) (Kawamata et al., 2023).

The system further supports ATM and ARM:

• ATM permits changes in answer types for pure computations, tracked by subtyping ($\square \le \tyctl{x}{C_1}{C_2}$) under suitable conditions.
• ARM allows precise tracking and modular reasoning about answer refinements via a controlled subtyping discipline.

2. CPS Semantics: Type and Term Translation

CPS semantics encodes effectful computations as explicit higher-order functions, reifying the continuation and the effect handler as additional arguments. Types in the source calculus are mapped to continuation-and-handler-passing types: $\begin{aligned} \cps{\{x:B\mid\phi\}} &= \{x:B\mid\phi\} \ \cps{(x:T)\to C} &= (x:\cps{T}) \to \cps{C} \ \cps{\mathsf{Comp}\langle\Sigma,T,\square\rangle} &= \forall\alpha.\, \cps{\Sigma} \to (\cps{T}\to\alpha) \to \alpha \ \cps{\mathsf{Comp}\langle\Sigma,T,\tyctl{x}{C_1}{C_2}\rangle} &= \cps{\Sigma} \to (x:\cps{T} \to \cps{C_1}) \to \cps{C_2} \ \cps{\Sigma} &= \{\op_i: \forall\overline{X}.\, \cps{F_i}\} \end{aligned}$ For computation terms: $\begin{aligned} \cps{\mathsf{return}\;v} &= \Lambda\alpha.\, \lambda h:\cps{\Sigma}.\, \lambda k:\cps{T}\to\alpha.\, k\,(\cps{v}) \ \cps{\mathit{op}(v)} &= \Lambda.\, \lambda h.\, \lambda k.\, (h\#\mathit{op})\,(\cps{v})\,(\lambda y.\,k\,y) \ \cps{\mathsf{with}\;h\;\mathsf{handle}\;c} &= \cps{c}\,\alpha\,(\cps{h}^{ops})\,(\cps{h}^{ret}) \end{aligned}$ Handler translation produces a record of operation implementations and a return clause: $\cps{h}^{ops} = \{\op_i = \Lambda.\, \lambda x_i.\, \lambda k_i.\, \cps{c_i}\}, \qquad \cps{h}^{ret} = \lambda x_r.\, \cps{c_r}$ (Kawamata et al., 2023).

3. Categorical and Equational Characterizations

CPS semantics for effect handlers are validated categorically via the characterization of models for effect-handling calculi. The essential categorical structures are:

• A cartesian category $\mathcal C$ with strong monads $T_\Sigma$ for each effect signature.
• Kleisli exponentials and distributive coproducts for interpreting control flow and effect combinations.
• Handlers correspond to algebra structures: $\mathcal{H}_\Sigma[X] = \prod_{(\mathsf{op}:A\to B)\in\Sigma} (\KleisliExp{T_\Sigma}{A}{X} \to X)$ In the specific CPS model (System F fibration), the monad for the CPS interpretation is: $$D_{(\Sigma,\mathcal{E})}(X) = \forall\beta.\, (X \to \beta) \to \left(\prod_{(\mathsf{op}:A\to B)\in\Sigma} (A \times (B \to \beta) \to \beta)\right) \to \beta$$ Handlers are passed as records; operations invoke the relevant handler clause with a value and continuation. These categorical models satisfy both the soundness and completeness theorems for the effect calculus' equational theory, ensuring that both CPS and free-monad models are valid and complete (Kura, 3 Feb 2026).

4. Meta-Theoretic Properties: Type Preservation and Simulation

CPS semantics enable rigorous meta-theoretic results:

• Forward Type Preservation: Well-typed source terms map to well-typed CPS terms under the translation, with types preserved up to subtyping:

$\Gamma\vdash v:T \implies \cps{\Gamma}\vdash \cps{v} : \cps{T}$

$\Gamma\vdash c:\mathsf{Comp}\langle\Sigma,T,S\rangle \implies \cps{\Gamma}\vdash \cps{c} : \cps{\mathsf{Comp}\langle\Sigma,T,S\rangle}$

• Backward Type Preservation: Typable CPS terms correspond to typable source terms, modulo subtyping.
• Operational Simulation: Reductions in the source language are simulated by reductions in the CPS target:

$c \longrightarrow^* \mathsf{return}\;v \implies \cps{c} \longrightarrow^+ v' \text{ with } v' \equiv_\beta \cps{v}$

These theorems enable the use of existing pure language verification technology for programs with effects after CPS translation (Kawamata et al., 2023), and form the basis for decidability results in typed calculi (Endo et al., 18 Aug 2025).

5. Worked Examples and Applications

A canonical example involves an increment effect: $$\mathit{inc} : \forall.\, (x:\mathsf{int}) \to ((y:\mathsf{int}) \to C_1) \to C_2$$ with handler: $$h = \{\; \mathsf{return}\;x_r \mapsto x_r,\quad \mathit{inc}(x,k) \mapsto k(x+2) \;\}$$ The term $$M = \mathsf{with}\;h\;\mathsf{handle}\;\mathit{inc}(3)$$ evaluates to 4. The CPS translation produces a higher-order term of type: $$\forall\alpha.\, \{\mathit{inc} : \forall.\, \ldots\} \to (\mathsf{int} \to \alpha) \to \alpha$$ and the simulation theorem ensures that reductions are mirrored in the CPS model.

In the case of decidability for ATM-typable finitary PCF with handlers, the CPS translation eliminates handlers by embedding them into first-order record and continuation passing, reducing reachability to a problem over pure PCF which is decidable (Endo et al., 18 Aug 2025).

6. Comparison: CPS Semantics vs. Direct Delimited-Continuation Reasoning

CPS semantics offer a uniform translation of delimited control and effects into pure language constructs, enabling the use of existing type systems and verification tools for pure calculi. The approach supports both ATM and ARM, with bidirectional type correspondence (modulo subtyping). Significant trade-offs are:

• Pros: Refined type preservation, reuse of pure language verification, operational correspondence.
• Cons: Increased code size and type annotation burden, reduced clarity and diagnostics.

Direct reasoning via ARM/ATM retains program structure and modular local reasoning but requires advanced, effect-aware refinement type systems and dedicated tooling.

Approach	Strengths	Limitations
CPS Semantics	Enables pure verification; type-correctness; reuse	Large, complex translation; verbose types; error locality
Direct (ARM/ATM)	Local, modular reasoning; close to source syntax	Demands advanced refinement type systems

Both approaches are complete within the categorical semantics of effect handlers (Kura, 3 Feb 2026).

7. Research Evolution and Future Directions

The integration of CPS semantics with complete categorical models closes the gap between operational and denotational (categorical) understanding of effect handlers. This alignment allows the development of advanced logical relation techniques—including fibrational and bi-orthogonal relations—over both CPS and free-monad models, enhancing reasoning principles for effectful programs. Ongoing work targets extensions to answer-type modification at the level of categorical semantics, higher-order and nested effects, and their logical relations foundations (Kura, 3 Feb 2026, Kawamata et al., 2023). In operational verification, CPS semantics underpins new decidability and termination results for effectful, ATM-typable programs (Endo et al., 18 Aug 2025).

A plausible implication is that further refinement of CPS translations—particularly to scale with complex refinements such as ARM—and categorical frameworks will facilitate the development of practical verification tools for effectful programming at scale.