An abstract, certified account of Operational Game Semantics
summary
An abstract, certified account builds operational game semantics formalized in Coq and gives a generic soundness theorem for OGS that covers polarized and non‑polarized mu and lambda calculi. It identifies the infinite chit‑chat failure mode in composing Proponent/Opponent strategies and resolves it by proving a finite‑chatter/ eventual guardedness condition that yields a well‑defined composition as a fixpoint in the delay monad; the construction is mechanized and yields adequacy for substitution.
AI-written summary · about