homepage: ''
changelog-type: markdown
hash: b59802cc2c68ac7162ab0638d0af5be1011fb9c7255a9cdd74e205b1088e3679
test-bench-deps: {}
maintainer: programming@manuelbaerenz.de
synopsis: A new, simple, composable concurrency abstraction.
changelog: |
  # Revision history for monad-schedule

  ## 0.1.0.0 -- YYYY-mm-dd

  * First version. Released on an unsuspecting world.
basic-deps:
  free: '>=5.1'
  stm: '>=2.5'
  base: '>=4.13.0 && <=4.17'
  time-domain: '>=0.1'
  transformers: '>=0.5'
all-versions:
- 0.1.0.0
author: Manuel Bärenz
latest: 0.1.0.0
description-type: haddock
description: |-
  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.
license-name: MIT

Update from Hackage at 2022-03-27T10:00:15Z
Update from Hackage at 2022-03-27T10:00:15Z
