A poor man's concurrency monad

KOEN CLAESSEN

doi:10.1017/S0956796899003342

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Information

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

van Weelden, Arjen and Plasmeijer, Rinus 2003. Implementation of Functional Languages. Vol. 2670, Issue. , p. 215.

Schröder, Lutz and Mossakowski, Till 2004. Algebraic Methodology and Software Technology. Vol. 3116, Issue. , p. 443.

Christiansen, Jan and Huch, Frank 2004. Searching for deadlocks while debugging concurrent haskell programs. ACM SIGPLAN Notices, Vol. 39, Issue. 9, p. 28.

Christiansen, Jan and Huch, Frank 2004. Searching for deadlocks while debugging concurrent haskell programs. p. 28.

Harrison, W.L. and Hook, J. 2005. Achieving Information Flow Security through Precise Control of Effects. p. 16.

Yingzhou Zhang and Baowen Xu 2005. A Slice Monad Transformer and Its Applications in Program Slicing. p. 147.

Walter, Dennis Schröder, Lutz and Mossakowski, Till 2005. Algebra and Coalgebra in Computer Science. Vol. 3629, Issue. , p. 424.

Huch, Frank and Kupke, Frank 2006. Implementation and Application of Functional Languages. Vol. 4015, Issue. , p. 124.

Harrison, William L. 2006. Algebraic Methodology and Software Technology. Vol. 4019, Issue. , p. 158.

Li, Peng and Zdancewic, Steve 2007. Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives. ACM SIGPLAN Notices, Vol. 42, Issue. 6, p. 189.

Swierstra, Wouter and Altenkirch, Thorsten 2007. Beauty in the beast. p. 25.

Li, Peng Marlow, Simon Peyton Jones, Simon and Tolmach, Andrew 2007. Lightweight concurrency primitives for GHC. p. 107.

Li, Peng and Zdancewic, Steve 2007. Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives. p. 189.

Vouillon, Jérôme 2008. Lwt. p. 3.

Haller, Philipp and Odersky, Martin 2009. Scala Actors: Unifying thread-based and event-based programming. Theoretical Computer Science, Vol. 410, Issue. 2-3, p. 202.

Kerneis, Gabriel and Chroboczek, Juliusz 2011. Continuation-Passing C, compiling threads to events through continuations. Higher-Order and Symbolic Computation, Vol. 24, Issue. 3, p. 239.

Petricek, Tomas Mycroft, Alan and Syme, Don 2011. Extending monads with pattern matching. p. 1.

Marlow, Simon Newton, Ryan and Peyton Jones, Simon 2011. A monad for deterministic parallelism. p. 71.

Petricek, Tomas Mycroft, Alan and Syme, Don 2012. Extending monads with pattern matching. ACM SIGPLAN Notices, Vol. 46, Issue. 12, p. 1.

Claessen, Koen Sheeran, Mary and Svensson, Bo Joel 2012. Expressive array constructs in an embedded GPU kernel programming language. p. 21.

Download full list

Article contents

A poor man's concurrency monad

Abstract

Information

Claessen Supplementary Material

Discussions

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

A poor man's concurrency monad

Abstract

Information

Claessen Supplementary Material

Discussions

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests