transient VS control-monad-free

Compare transient vs control-monad-free 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-free

Free monads and monad transformers (by pepeiborra)
Our great sponsors
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • SonarQube - Static code analysis for 29 languages.
  • SaaSHub - Software Alternatives and Reviews
transient control-monad-free
0 0
627 7
0.0% -
0.0 0.0
almost 2 years ago over 1 year 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-free

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

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

What are some alternatives?

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

contravariant - Haskell 98 contravariant functors

tardis

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

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

fused-effects - A fast, flexible, fused effect system for Haskell

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

mtl - The Monad Transformer Library

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

rio-orphans - A standard library for Haskell

freer-simple - A friendly effect system for Haskell

record - Anonymous records

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