3 papers
cs.PL2025
Bialgebraic Reasoning on Stateful Languages
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the obser…
cs.LO2024
Higher-order bialgebraic semantics
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi a…
cs.LO2022
Stateful Structural Operational Semantics
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees composit…