hoare: Simple tools for communicating sequential processes

[ concurrency, library ] [ Propose Tags ] [ Report a vulnerability ]

Hoare was right—many concurrent programs can be simply expressed as a series of concurrent actors (threads) consuming and producing messages. Haskell provides uniquely great tools (green threads and STM) for doing so. This package provides:

  • Functions for using bounded STM types like TBQueue and TMVar as channels between threads.

  • A closeable TBCQueue and TCSlot for programs where the input ends.

  • A "split" API on top of the above, using newtypes to distinguish the producer side from the consumer side.

  • Some wrappers to gather metrics (items produced/consumed, wait times). This API is experimental and unstable.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.1.1.0, 0.2.0.0
Dependencies async (>=2.2 && <3), base (>=4.20 && <5), clock (>=0.8.4 && <0.9), deepseq (>=1.5 && <2), stm (>=2.5 && <3) [details]
Tested with ghc ==9.12.4
License Zlib
Author Matt Kline
Maintainer matt@bitbashing.io
Uploaded by mrkline at 2026-11-18T08:09:13Z
Category Concurrency
Source repo head: git clone https://github.com/mrkline/hoare
Distributions LTSHaskell:0.1.1.0, Stackage:0.2.0.0
Downloads 100 total (8 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]