transient VS control-monad-failure

Compare transient vs control-monad-failure and see what are their differences.

transient

A full stack, reactive architecture for general purpose programming. Algebraic and monadically composable primitives for concurrency, parallelism, event handling, transactions, multithreading, Web, and distributed computing with complete de-inversion of control (No callbacks, no blocking, pure state) (by transient-haskell)

control-monad-failure

A class of monads which can fail with an error (by pepeiborra)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
transient control-monad-failure
- -
629 4
0.3% -
0.0 0.0
about 3 years ago almost 14 years ago
Haskell Haskell
MIT License LicenseRef-PublicDomain
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.

transient

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

We haven't tracked posts mentioning transient yet.
Tracking mentions began in Dec 2020.

control-monad-failure

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

We haven't tracked posts mentioning control-monad-failure yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing transient and control-monad-failure you can also consider the following projects:

failure - A simple type class for success/failure computations.

freer-simple - A friendly effect system for Haskell

arrowapply-utils - A test implementation of draft versions of CellML 1.2

pipes - Compositional pipelines

selective - Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically

rio-orphans - A standard library for Haskell

can-i-haz - Generic implementation of the Has pattern for MonadReader/MonadState and CoHas for MonadError

machines - Networks of composable stream transducers

imm - Execute arbitrary actions for each unread element of RSS/Atom feeds

recursion-schemes - Generalized bananas, lenses and barbed wire

transient-universe - A Cloud monad based on transient for the creation of Web and reactive distributed applications that are fully composable, where Web browsers are first class nodes in the cloud

distributed-closure - Serializable closures for distributed programming.