retry VS telega

Compare retry vs telega and see what are their differences.

retry

Retry combinators for monadic actions that may fail (by Soostone)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
retry telega
- -
111 3
0.9% -
1.6 0.0
about 1 year ago almost 3 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.

retry

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

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

telega

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

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

What are some alternatives?

When comparing retry and telega you can also consider the following projects:

monad-time

abstract-par

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

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)

atl - Arrow Transformer Library

conduit-combinators - Type classes for mapping, folding, and traversing monomorphic containers

recursion-schemes - Generalized bananas, lenses and barbed wire

machines - Networks of composable stream transducers

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

foldl - Composable, streaming, and efficient left folds

ReplicateEffects - Composable replication schemes of applicative functors in Haskell