Read-Copy-Update for Haskell
|Version on this page:||0.2.3|
|LTS Haskell 20.23:||0.2.6|
|Stackage Nightly 2023-05-31:||0.2.6|
|Latest on Hackage:||0.2.6|
Module documentation for 0.2.3
This package is an exploration of Read-Copy Update in Haskell based on Relativistic Programming in Haskell by Cooper and Walpole. It includes a sound QSBR-based implementation and an attempt at an STM-based implementation.
In the spirit of A Relativistic Enhancement to Software Transactional Memory
by Howard and Walpole, we could extend the STM implementation to allow reads and writes on the same data in parallel, writes to disjoint data in parallel, and force readers to agree that writes before a
synchronize happened before writes after it.
Development on this project proceeded in a burst of enthusiasm after Edward saw Ted’s poster presentation at ICFP 2015, and yet somehow he managed to shanghai Ted into helping maintain this copy of his own work.
Contributions and bug reports are welcome!
Please feel free to contact us through github or on the #haskell IRC channel on irc.freenode.net.
-Edward Kmett and Ted Cooper
HLint.hswith the tarball distribution, fixing the
cabal-doctest. This makes it build with
Cabal-2.0, and makes the
doctests work with
cabal new-buildand sandboxes.
- Initial version