Haskell Concurrency

Beautiful Streaming, Concurrent and Reactive Composition

Run IO operations asynchronously and wait for their results

Parallel scheduler, LVar data structures, and infrastructure to build more.

Run MonadConc operations asynchronously and wait for their results.

Chase & Lev work-stealing lock-free double-ended queues (deques).

Fast concurrent queues with a Chan-like API, and more

Model-view-controller

Cached and parallel data fetching.

Introduces conduits to channels, and promotes using conduits concurrently.

Concurrency for the pipes ecosystem

OTP-like supervision trees in Haskell

Concurrent PostgreSQL data consumers

Running worker processes under system resource restrictions

Containers for STM

A command line type checker for CSPM files.

Fork threads and wait for their result

Distributed, stateful, homogeneous microservice framework.

Run lifted IO operations asynchronously and wait for their results

Extra queue utilities for STM

Extra concurrency primitives

Simple, IO-based library for Erlang-style thread supervision

Lazy demand-driven promises

Concurrent networked stream transducers

Sirkel, a Chord DHT

A fast concurrent unique identifier supply with a pure API

Spawn threads that never die (unless told to do so)

A principal solution to ghost threads and silent exceptions

Unbounded thread delays and timeouts

Simple package that implements timers.

A typeclass for mutable references that have an atomic modify operation.

Non-blocking concurrent map

Much safer replacement for QSemN, QSem, and SampleVar

(deprecated in favor of 'threads') Simple thread management

Loop over an action but throttle it to a certain rate

Rate limiter using lazy bucket algorithm

Concurrent and combinable updates

Implementation of bounded channels.

Kick Channels

Provides access to the dynamic pointer tagging bits used by GHC.

Fully concurrent unique identifiers

A fast, cache-efficient, concurrent bloom filter

Go-style channels

Control.Concurrent.Chan split into sending and receiving halves.

A library for more structured concurrent programming, based on the Actor Model

Unagi Chan IO-Streams

A concurrent utility inspired by Ticker in golang

A monadic interface for async

Generalized sleep and timeout functions

Updatable timeouts as a Monad transformer

Contention-free STM hash map

Tiny library for concurrent computations

Streaming to and from subprocesses using Pipes

Concurrent actions that may fail with a value.

Runs a time-limited computation alowing it to return intermediate results.

A named lock that is created on demand.

Chunked Communication Queues

A simple round-robin data type

Limit number of IO actions started per second

Extra Utilities for the Async Library

NCurses interface to view multiple ByteString streams in parallel.

Simple package that allows for long thread suspensions.

Throttler between arbitrary IO producer and consumer functions

Lightweight Erlang-style actors for Haskell.

Practical actors for Haskell.

Basic Erlang-like process support for Haskell

Bundles shared calls to IO functions to perform them only once

Provides API for timer based execution of IO actions

Baisc, Erlang-like message passing supporting sockets.

Concurrent channels with a forwarding primitive

Synchronize actions to a time pulse

Transactional I/O for duplex streams

Fast concurrent queues much inspired by unagi-chan

Multiple-read / single-write locks

utility for collapsing adjacent writes

Simple Haskel thread management in hierarchical manner

Simple thread barriers

Useful concurrent combinators

Thread delay and timeout functions with typed arguments

Heartbeats for io-streams

Extra STM functions

STM's TChan split into sending and receiving halves.

Minimalistic actor library

A trivial lock based on MVar.

GraphHammer Haskell graph analyses framework inspired by STINGER.

mecha are the most complex composite machines known to humanity, lets build them well!