transient VS imm

Compare transient vs imm 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)

imm

Execute arbitrary actions for each unread element of RSS/Atom feeds (by k0ral)
Our great sponsors
  • Zigi - The context switching struggle is real
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Truly a developer’s best friend
  • InfluxDB - Build time-series-based applications quickly and at scale.
transient imm
0 0
627 14
0.0% -
0.0 0.0
almost 2 years ago about 2 months ago
Haskell Haskell
MIT License Creative Commons Zero v1.0 Universal
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.

imm

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

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

What are some alternatives?

When comparing transient and imm you can also consider the following projects:

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

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

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

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

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

cloud-haskell - This is an umbrella development repository for Cloud Haskell

control-monad-free - Free monads and monad transformers

machines - Networks of composable stream transducers

control-monad-failure - A class of monads which can fail with an error

cr

hask - Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)

effect-monad - Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.