Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction

Abstract

We look at the operational semantics of languages with interactive I/O through the glasses of constructive type theory. Following on from our earlier work on coinductive trace-based semantics for While, we define several big-step semantics for While with interactive I/O, based on resumptions and termination-sensitive weak bisimilarity. These require nesting inductive definitions in coinductive definitions, which is interesting both mathematically and from the point-of-view of implementation in a proof assistant. After first defining a basic semantics of statements in terms of resumptions with explicit internal actions (delays), we introduce a semantics in terms of delay-free resumptions that essentially removes finite sequences of delays on the fly from those resumptions that are responsive. Finally, we also look at a semantics in terms of delay-free resumptions supplemented with a silent divergence option. This semantics hinges on decisions between convergence and divergence and is only equivalent to the basic one classically. We have fully formalized our development in Coq

The Coinductive Resumption Monad

“…In type theory, similar constructions were used to model interactive programs (Hancock and Setzer [22]), general recursion via guarded corecursion (Capretta [12]), or semantics of imperative languages (Nakata and Uustalu [36]). …”

A Coinductive Confluence Proof for Infinitary Lambda-Calculus

“…Our presentation of coinductive proofs is similar to e.g. [19,8,37,34,31]. There are many ways in which our coinductive proofs could be justified.…”

A syntactic type system for recursive modules

“…The labeled transition system is parameterized by the typing context (Γ, ∆). Alternatively, we could have defined type equivalence more declaratively using mixed induction-coinduction in the style of [29]. Indeed, our account of cyclic types and type abbreviations relies on the ability to mix induction and coinduction, which weak bisimilarity naturally supports by definition.…”