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.

[maintain] [Publish]

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.


Versions,,,,,, 0.2
Change log
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
Category Concurrency
Uploaded by turion at 2022-03-27T09:37:45Z


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees