monad-schedule: A new, simple, composable concurrency abstraction.
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 .
Other actions are still running, and for these you will receive continuations of type NonEmpty am a,
which you can further run or schedule to completion as you like.
Modules
[Index] [Quick Jump]
Downloads
- monad-schedule-0.1.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.2.2, 0.2, 0.2.0.1, 0.2.0.2, 1.6 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.13.0 && <=4.17), free (>=5.1), stm (>=2.5), time-domain (>=0.1), transformers (>=0.5) [details] |
| License | MIT |
| Author | Manuel Bärenz |
| Maintainer | programming@manuelbaerenz.de |
| Uploaded | by turion at 2022-06-26T13:23:53Z |
| Category | Concurrency |
| Distributions | LTSHaskell:0.2.0.2, Stackage:1.6 |
| Reverse Dependencies | 3 direct, 1 indirect [details] |
| Downloads | 970 total (47 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2022-06-26 [all 1 reports] |