selective VS transient

Compare selective vs transient and see what are their differences.

selective

Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically (by snowleopard)

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
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
selective transient
1 -
200 629
- 0.3%
4.4 0.0
12 days ago about 3 years ago
TeX Haskell
MIT 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.

selective

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

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 selective and transient 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.

funflow - Functional workflows

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

atl - Arrow Transformer Library

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

distributed-closure - Serializable closures for distributed programming.

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

machinecell - Arrow based stream transducer

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

schedule - Schedule sub-computations to run later, in a pure way

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