Concurrent monads for shared state
Open Access
- 9 September 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Abstract
In the monad-based approach to functional programming with effects, sequential composition, the primary high-level control structure for combining effectful functions, takes a special role. In this article, we advocate the idea that parallel composition should be recognized as a high-level control structure on an equal footing with sequential composition. We promote the concept of concurrent monad, which axiomatizes both sequential and parallel composition, and illustrate the approach by describing two concurrent monads for interleaving shared state concurrency: one of resumptions, the other of collections of traces.Keywords
Funding Information
- Rannís (228684-052)
This publication has 32 references indexed in Scilit:
- A Denotational Approach to Release/Acquire Concurrency2024
- Duoidally Enriched Freyd Categories2023
- An Algebraic Theory for Shared-State Concurrency2022
- Preorders on Monads and Coalgebraic Simulations2013
- Kleene Monads: Handling Iteration in a Framework of Generic EffectsLecture Notes in Computer Science, 2009
- Understanding the Small Object ArgumentApplied Categorical Structures, 2008
- A Kleisli-based Approach to Lax AlgebrasApplied Categorical Structures, 2007
- Notions of Computation Determine Monads2002
- The equational theory of pomsetsTheoretical Computer Science, 1988
- Strong functors and monoidal monadsArchiv der Mathematik, 1972