Operational game semantics for generative algebraic effects and handlers
summary
Describes a typed call-by-value λ-calculus with first-class effect instances and dynamic generation plus a public/private disclosure discipline; builds an operational game semantics as a labeled-transition trace model where moves record question/return, effect parameter and continuation names; proves the refined canonical trace equivalence is sound: trace equivalence implies contextual equivalence; conjectures completeness and outlines a definability approach plus a rewriting/forward-move permutation to remove intensional distinctions.
AI-written summary · about
