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

[ concurrency, library, mit ] [ Propose Tags ] [ Report a vulnerability ]

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.

Downloads

Maintainer's Corner

Package maintainers

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
Change log CHANGELOG.md
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]
Tested with ghc ==8.8.4, ghc ==8.10.7, ghc ==9.0.2, ghc ==9.2.5, ghc ==9.4.5, ghc ==9.6.2, ghc ==9.8.1
License MIT
Author Manuel Bärenz
Maintainer programming@manuelbaerenz.de
Category Concurrency
Source repo head: git clone https://github.com/turion/monad-schedule
Uploaded by turion at 2024-02-05T15:28:45Z
Distributions LTSHaskell:0.2.0.2, NixOS:0.2.0.1, Stackage:0.2.0.2
Reverse Dependencies 3 direct, 1 indirect [details]
Downloads 728 total (5 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]