stm-containers VS named-lock

Compare stm-containers vs named-lock and see what are their differences.


Containers for STM (by nikita-volkov)


A named lock that is created on demand. (by nominolo)
Our great sponsors
  • Scout APM - Truly a developer’s best friend
  • SonarQube - Static code analysis for 29 languages.
  • - Download’s Tech Salary Report
stm-containers named-lock
2 0
58 1
- -
0.0 0.0
almost 2 years ago about 13 years ago
Haskell Haskell
MIT License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.


Posts with mentions or reviews of stm-containers. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-07-26.


Posts with mentions or reviews of named-lock. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning named-lock yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing stm-containers and named-lock you can also consider the following projects:

stm-conduit - STM-based channels for conduits.

concurrent-supply - A fast globally unique variable supply with a pure API

stm-queue-extras - Extra utilities for STM queues

timeout - Generalized sleep and timeout functions

BoundedChan - Bounded (limited capacity) channels for Haskell

stm-incremental - A very simple interface for incremental computation using STM in Haskell.

concurrent-machines - Concurrency features for the Haskell machines package

stm-chunked-queues - Thread communication queues that group items/requests that occur close together in time

theatre - Minimalistic actor library for Haskell

unbounded-delays - Unbounded thread delays and timeouts

restricted-workers - Interactive-diagrams

async-dejafu - Systematic concurrency testing meets Haskell.