monad-schedule: A new, simple, composable concurrency abstraction.

[ concurrency, library, mit ] [ Propose Tags ]

A monad m is said to allow scheduling if you can pass a number of actions m a to it, and those can be executed at the same time concurrently. You can observe the result of the actions after some time: Some actions will complete first, and the results of these are returned then as a list NonEmpty a. Other actions are still running, and for these you will receive continuations of type m a, which you can further run or schedule to completion as you like.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,,
Change log
Dependencies base (>=4.13.0 && <4.20.0), free (>=5.1 && <5.3), stm (>=2.5 && <2.6), time-domain (>=0.1 && <0.2), transformers (>=0.5 && <0.7) [details]
License MIT
Author Manuel Bärenz
Category Concurrency
Source repo head: git clone
Uploaded by turion at 2024-02-05T15:28:45Z
Distributions LTSHaskell:, NixOS:, Stackage:
Reverse Dependencies 3 direct, 1 indirect [details]
Downloads 354 total (24 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2024-02-05 [all 1 reports]