barrucadu/dejafu
1
1
Fork 0
mirror of https://github.com/barrucadu/dejafu.git synced 2024-12-18 19:11:37 +03:00
Code Issues Projects Releases Wiki Activity
Systematic concurrency testing meets Haskell.
179 Commits 2 Branches 194 Tags 3.4 MiB
Haskell 99.9%
Shell 0.1%
2ca7337b01
Go to file
Michael Walker 2ca7337b01 Avoid scheduling decisions which immediately block (in PB-bounded runner)
2015-07-08 20:06:15 +01:00
Control More transformer instances (inc. strict versions) 2015-05-30 01:45:20 +01:00
Data/List Use schedule bounding as the primary SCT approach. 2015-06-19 16:50:51 +01:00
Test Avoid scheduling decisions which immediately block (in PB-bounded runner) 2015-07-08 20:06:15 +01:00
tests Make the stmAtomic test actually test STM atomicity 2015-07-08 18:18:18 +01:00
.gitignore Initial commit: a class for monads providing concurrency. 2014-12-18 11:03:17 +00:00
.travis.yml Use cabal-1.22 in travis 2015-02-16 03:38:50 +00:00
dejafu.cabal Use schedule bounding as the primary SCT approach. 2015-06-19 16:50:51 +01:00
LICENSE Switch to MIT license 2015-03-13 14:58:42 +00:00
README.markdown Rename and remodularise 2015-01-31 15:50:54 +00:00
Setup.hs Initial commit: a class for monads providing concurrency. 2014-12-18 11:03:17 +00:00

README.markdown

dejafu 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 class of monads for potentially nondeterministic concurrency, with an interface very much in the spirit of Par, but slightly more relaxed. Specifically, MonadConc's IVar equivalent, CVars, can be written to multiple times.

The documentation of the latest developmental version is available online.

MonadConc and IO

The intention of the MonadConc class is to provide concurrency where any apparent nondeterminism arises purely from the scheduling behaviour. To put it another way, a given 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.

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).