Bialgebraic Reasoning on Stateful Languages
summary
Proposes a concrete operational encoding that splits programs into readers (expecting an input store) and writers (running computations tagged with a store) and shows this two-sorted reader/writer semantics is compatible with abstract GSOS and coalgebraic weak bisimilarity. Uses category theory, relation liftings, and a higher‑order GSOS extension (bifunctor behaviour) to get compositional congruence results for trace, cost and termination equivalences, handles first‑order and higher‑order store, and exhibits worked examples.
AI-written summary · about