rio-orphans VS control-monad-failure

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

rio-orphans

A standard library for Haskell (by commercialhaskell)

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
rio-orphans control-monad-failure
6 -
828 4
0.0% -
0.0 0.0
about 1 year 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.

rio-orphans

Posts with mentions or reviews of rio-orphans. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-11-11.

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 rio-orphans and control-monad-failure you can also consider the following projects:

basic-prelude - An enhanced core prelude, meant for building up more complete preludes on top of.

freer-simple - A friendly effect system for Haskell

time-warp

pipes - Compositional pipelines

ghc-proposals - Proposed compiler and language changes for GHC and GHC/Haskell

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)

bytestring-progress - A Haskell library for tracking the consumption of lazy ByteStrings

machines - Networks of composable stream transducers

ifcxt - constraint level if statements

recursion-schemes - Generalized bananas, lenses and barbed wire

cond - Basic conditional operators with monadic variants.

distributed-closure - Serializable closures for distributed programming.