hask VS transient

Compare hask vs transient and see what are their differences.

hask

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

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)
Our great sponsors
  • Onboard AI - Learn any GitHub repo in 59 seconds
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • SonarLint - Clean code begins in your IDE with SonarLint
  • Revelo Payroll - Free Global Payroll designed for tech teams
hask transient
0 0
160 628
- 0.0%
0.0 0.0
over 2 years ago over 2 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT 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.

hask

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

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

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.

What are some alternatives?

When comparing hask and transient 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

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

record - Anonymous records

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

funflow - Functional workflows

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

exceptions - mtl friendly exceptions

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

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

auto - Haskell DSL and platform providing denotational, compositional api for discrete-step, locally stateful, interactive programs, games & automations. http://hackage.haskell.org/package/auto

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