transient vs ImperativeHaskell

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)

Source Code

Suggest alternative

Edit details

ImperativeHaskell

Proof that Haskell can look and act like an imperative language. (by mmirman)

Control

Source Code

Suggest alternative

Edit details

Our great sponsors

WorkOS - The modern identity platform for B2B SaaS

InfluxDB - Power Real-Time Data Analytics at Scale

SaaSHub - Software Alternatives and Reviews

Our great sponsors

transient		ImperativeHaskell
	Project
-	Mentions	-
629	Stars	74
0.3%	Growth	-
0.0	Activity	0.0
about 3 years ago	Latest Commit	almost 12 years ago
Haskell	Language	Haskell
MIT License	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:

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

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

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

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

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

distributed-closure - Serializable closures for distributed programming.

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

abstract-par

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

free - free monads

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

motor - Type-safe effectful state machines in Haskell