dejafu/README.markdown

42 lines
1.6 KiB
Markdown
Raw Normal View History

2014-12-20 20:32:35 +03:00
monad-conc [![Build Status][build-status]][build-log]
==========
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, `CVar`s, can be written to multiple times.
2014-12-20 21:17:43 +03:00
The documentation of the latest developmental version is
[available online][docs].
2015-01-12 17:24:12 +03:00
`Conc` and `IO`
---------------
The intention of the `Conc` monads is to provide concurrency where any
apparent nondeterminism arises purely from the scheduling
behaviour. To put it another way, a given `Conc` computation,
parametrised with a fixed set of scheduling decisions, is
deterministic. This assumption is used by the testing functionality
provided by Control.Monad.Conc.SCT.
Whilst this assumption may not hold in general when `IO` is involved,
you should strive to produce test cases where it does.
2014-12-20 20:32:35 +03:00
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).
[build-status]: https://travis-ci.org/barrucadu/monad-conc.svg?branch=master
[build-log]: https://travis-ci.org/barrucadu/monad-conc
[abstract-par]: https://hackage.haskell.org/package/abstract-par/docs/Control-Monad-Par-Class.html
2014-12-20 21:17:43 +03:00
[docs]: https://barrucadu.github.io/monad-conc