rcu
Read-Copy-Update for Haskell
| Version on this page: | 0.2.5 |
| LTS Haskell 24.17: | 0.2.7@rev:1 |
| Stackage Nightly 2025-10-26: | 0.2.7@rev:1 |
| Latest on Hackage: | 0.2.7@rev:1 |
rcu-0.2.5@sha256:91cce42f481f682c1ed734e62944c5aa87d6f4c82fdedbe69df134382628dc89,11913Module documentation for 0.2.5
- Control
- Control.Concurrent
rcu
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.
Contact Information
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