transient VS machines

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

machines

Networks of composable stream transducers (by ekmett)
Our great sponsors
  • Zigi - Delete the most useless function ever: context switching.
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Truly a developer’s best friend
transient machines
0 0
627 325
0.0% -
0.0 4.3
over 1 year ago 4 months ago
Haskell Haskell
MIT 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.

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.

machines

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

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

What are some alternatives?

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

pipes - Compositional pipelines

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

daemons - Daemons in Haskell made fun and easy

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

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

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

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

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

capability - Extensional capabilities and deriving combinators

recursion-schemes - Generalized bananas, lenses and barbed wire

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