freer-simple VS cond

Compare freer-simple vs cond and see what are their differences.

freer-simple

A friendly effect system for Haskell (by lexi-lambda)

cond

Basic conditional operators with monadic variants. (by kallisti-dev)
Our great sponsors
  • Nanos - Run Linux Software Faster and Safer than Linux with Unikernels
  • Scout APM - A developer's best friend. Try free for 14-days
  • SaaSHub - Software Alternatives and Reviews
freer-simple cond
2 0
194 8
- -
0.0 0.0
23 days ago over 2 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.

freer-simple

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

cond

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

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

What are some alternatives?

When comparing freer-simple and cond you can also consider the following projects:

eff - 🚧 a work in progress effect system for Haskell 🚧

extensible-effects - Extensible Effects: An Alternative to Monad Transformers

polysemy - :gemini: higher-order, no-boilerplate monads

daemons - Daemons in Haskell made fun and easy

rio-orphans - A standard library for Haskell

mtl - The Monad Transformer Library

machines - Networks of composable stream transducers

pipes - Compositional pipelines

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)

capability - Extensional capabilities and deriving combinators

free - free monads