We present a monad-based semantics for a basic programming language for shared-state concurrency i.e. global-state in the presence of concurrency. We follow Plotkin and Power’s algebraic effect methodology, using an equational theory and a representation theorem for it. The theory we propose, CON, consists of 5 operators and 23 equations. We rely on the methodology’s modularity: 3 equations are new, while the rest are either commutativity laws or inherited from the theories of global-state and non-determinism.
Sun 22 AugDisplayed time zone: Seoul change
20:00 - 21:30
|Higher-Order Asynchronous Effects|
Danel Ahman University of Ljubljana, Matija Pretnar University of Ljubljana, Slovenia, Janez Radešček University of LjubljanaPre-print File Attached
Sam Lindley The University of Edinburgh, UKFile Attached
|A Monad for Shared-State Concurrency|