FUNCT I ONAL PEARLS A Poor Man's Concurrency Monad
Abstract:
Without adding any primitives to the language, we define a concurrency monad transformer in Haskell. This allows us to add a limited form of concurrency to any existing monad. The atomic actions of the new monad are lifted actions of the underlying monad. Some extra operations, such as fork, to initiate new processes, are provided. We discuss the implementation, and use some examples to illustrate the usefulness of this construction. 1
Citations
| 156 | Monad transformers and modular interpreters – Liang, Hudak, et al. - 1995 |
| 145 | Concurrent Haskell – Jones, Gordon, et al. - 1996 |
| 71 | Type classes: an exploration of the design space – Jones, Jones, et al. - 1997 |
| 26 | Implicit and Explicit Parallel Programming in Haskell – Jones, Hudak - 1993 |
| 6 | An Introduction to TkGofer – Vullinghs, Schulte, et al. - 1996 |
| 1 | Functional pearls 11 – YALEUDCSRR-982 - 1997 |
| 1 | A Concurrency Monad Based on Constructor Primitives – Scholz - 1995 |

