Skip to main content
×
Home
    • Aa
    • Aa

A poor man's concurrency monad

  • KOEN CLAESSEN (a1)
    • Published online: 01 May 1999
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.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
Type Description Title
UNKNOWN

Claessen Supplementary Material

 Unknown (699 bytes)
699 bytes

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 37 *
Loading metrics...

Abstract views

Total abstract views: 133 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd May 2017. This data will be updated every 24 hours.

Errata