monad-schedule: A new, simple, composable concurrency abstraction.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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 am a,
which you can further run or schedule to completion as you like.
Properties
| Versions | 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.0, 0.1.2.1, 0.1.2.2 |
|---|---|
| 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 |
| Category | Concurrency |
| Uploaded | by turion at 2022-06-26T13:14:58Z |
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
Package maintainers
For package maintainers and hackage trustees