transient VS ImperativeHaskell

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

ImperativeHaskell

Proof that Haskell can look and act like an imperative language. (by mmirman)
Our great sponsors
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • SonarLint - Clean code begins in your IDE with SonarLint
  • Zigi - Workflow assistant built for devs & their teams
  • Scout APM - Truly a developer’s best friend
transient ImperativeHaskell
0 0
627 74
0.0% -
0.0 0.0
over 1 year ago over 10 years ago
Haskell Haskell
MIT License GNU General Public License v3.0 only
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.

ImperativeHaskell

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

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

What are some alternatives?

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

apecs - a fast, extensible, type driven Haskell ECS framework for games

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

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

ConstraintKinds - Implements common Haskell type classes using the constraint kinds pattern to allow constraints.

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

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

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

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

control-monad-free - Free monads and monad transformers

machines - Networks of composable stream transducers

distributed-closure - Serializable closures for distributed programming.

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