Systematic concurrency testing meets Haskell.
Go to file
2014-12-21 13:25:48 +00:00
Control/Monad/Conc Record possible alternative scheduling decisions in SCT 2014-12-21 13:25:48 +00:00
.gitignore Initial commit: a class for monads providing concurrency. 2014-12-18 11:03:17 +00:00
.travis.yml Add README 2014-12-20 17:32:35 +00:00
LICENSE Initial commit: a class for monads providing concurrency. 2014-12-18 11:03:17 +00:00
monad-conc.cabal Add some helpful CVar combinators 2014-12-21 09:38:25 +00:00
README.markdown Add link to docs in README 2014-12-20 18:17:43 +00:00
Setup.hs Initial commit: a class for monads providing concurrency. 2014-12-18 11:03:17 +00:00

monad-conc Build Status

Concurrency is nice, deadlocks and race conditions not so much. The Par monad family, as defined in abstract-par provides deterministic parallelism, but sometimes we can tolerate a bit of nondeterminism.

This package provides a family of monads for potentially nondeterministic concurrency, with an interface very much in the spirit of Par, but slightly more relaxed. Specifically, Conc's IVar equivalent, CVars, can be written to multiple times.

The documentation of the latest developmental version is available online.

Contributing

Bug reports, pull requests, and comments are very welcome!

Feel free to contact me on GitHub, through IRC (#haskell on freenode), or email (mike@barrucadu.co.uk).