recursion-schemes alternatives and similar packages

Based on the "Control" category.
Alternatively, view recursion-schemes alternatives based on common mentions on social networks and blogs.

• rio-orphans

  9.9 0.0 recursion-schemes VS rio-orphans

  A standard library for Haskell
  

• pipes

  9.8 0.0 recursion-schemes VS pipes

  Compositional pipelines

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com



• machines

  9.8 3.6 recursion-schemes VS machines

  Networks of composable stream transducers

• funflow

  9.8 3.5 recursion-schemes VS funflow

  Functional workflows
  

• mtl

  9.8 0.0 recursion-schemes VS mtl

  The Monad Transformer Library
  

• transient

  9.8 0.0 recursion-schemes VS 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)
  

• fused-effects

  9.8 4.5 recursion-schemes VS fused-effects

  A fast, flexible, fused effect system for Haskell
  

• apecs

  9.7 7.3 recursion-schemes VS apecs

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

• freer-simple

  9.6 0.0 recursion-schemes VS freer-simple

  A friendly effect system for Haskell

• record

  9.6 0.0 recursion-schemes VS record

  Anonymous records

• free

  9.6 4.1 recursion-schemes VS free

  free monads

• classy-prelude

  9.6 5.9 recursion-schemes VS classy-prelude

  Type classes for mapping, folding, and traversing monomorphic containers

• capability

  9.6 2.7 recursion-schemes VS capability

  Extensional capabilities and deriving combinators
  

• classy-prelude-yesod

  9.6 5.9 recursion-schemes VS classy-prelude-yesod

  Type classes for mapping, folding, and traversing monomorphic containers

• foldl

  9.6 4.3 recursion-schemes VS foldl

  Composable, streaming, and efficient left folds

• safe-exceptions

  9.5 3.4 recursion-schemes VS safe-exceptions

  Safe, consistent, and easy exception handling
  

• these

  9.5 4.3 recursion-schemes VS these

  An either-or-both data type, with corresponding hybrid error/writer monad transformer.
  

• extensible-effects

  9.5 0.0 recursion-schemes VS extensible-effects

  Extensible Effects: An Alternative to Monad Transformers

• auto

  9.5 0.0 recursion-schemes VS auto

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

• unliftio

  9.5 3.9 recursion-schemes VS unliftio

  The MonadUnliftIO typeclass for unlifting monads to IO
  

• selective

  9.5 4.4 recursion-schemes VS selective

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

• distributed-closure

  9.5 3.9 recursion-schemes VS distributed-closure

  Serializable closures for distributed programming.
  

• ComonadSheet

  9.4 0.0 recursion-schemes VS ComonadSheet

  A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comonads.

• hask

  9.4 0.0 recursion-schemes VS hask

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

• retry

  9.4 1.6 recursion-schemes VS retry

  Retry combinators for monadic actions that may fail
  

• abstract-par

  9.4 5.6 recursion-schemes VS abstract-par

  Type classes generalizing the functionality of the 'monad-par' library.

• parallel

  9.3 4.4 recursion-schemes VS parallel

  a library for parallel programming
  

• transient-universe

  9.3 0.0 recursion-schemes VS 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
  

• cloud-haskell

  9.2 0.0 recursion-schemes VS cloud-haskell

  DISCONTINUED. This is an umbrella development repository for Cloud Haskell
  

• either

  9.2 0.6 recursion-schemes VS either

  the EitherT monad transformer

• frpnow

  9.2 0.0 recursion-schemes VS frpnow

  Principled practical FRP

• distributed-fork

  9.2 0.0 recursion-schemes VS distributed-fork

  A distributed data processing framework in Haskell.

• monad-validate

  9.1 0.0 recursion-schemes VS monad-validate

  DISCONTINUED. (NOTE: REPOSITORY MOVED TO NEW OWNER: https://github.com/lexi-lambda/monad-validate) A Haskell monad transformer library for data validation
  

• tardis

  9.1 5.5 recursion-schemes VS tardis

  Bidirectional state monad transformer

• ifcxt

  9.1 0.0 recursion-schemes VS ifcxt

  constraint level if statements

• deepseq

  9.1 3.3 recursion-schemes VS deepseq

  Deep evaluation of data structures
  

• contravariant

  9.1 0.0 recursion-schemes VS contravariant

  Haskell 98 contravariant functors

• distributed-process-platform

  9.1 0.0 recursion-schemes VS distributed-process-platform

  DEPRECATED (Cloud Haskell Platform) in favor of distributed-process-extras, distributed-process-async, distributed-process-client-server, distributed-process-registry, distributed-process-supervisor, distributed-process-task and distributed-process-execution
  

• errors

  9.0 3.1 recursion-schemes VS errors

  Type-safe error handling

• freer-effects

  9.0 0.0 recursion-schemes VS freer-effects

  DISCONTINUED. An implementation of "Freer Monads, More Extensible Effects".
  

• effect-monad

  9.0 0.0 recursion-schemes VS effect-monad

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

• monad-control

  9.0 0.0 recursion-schemes VS monad-control

  Lift control operations, like exception catching, through monad transformers

• ixmonad

  9.0 0.0 recursion-schemes VS ixmonad

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

• operational

  9.0 4.3 recursion-schemes VS operational

  Implement monads by specifying instructions and their desired operational semantics.

• lens-tutorial

  8.9 0.0 recursion-schemes VS lens-tutorial

  The missing tutorial module for the lens library

• monad-time

  8.9 4.6 recursion-schemes VS monad-time

  Type class for monads which carry the notion of the current time.
  

• exceptions

  8.9 5.4 recursion-schemes VS exceptions

  mtl friendly exceptions

• mmorph

  8.9 0.0 recursion-schemes VS mmorph

  Monad morphisms

• motor

  8.9 0.0 recursion-schemes VS motor

  Type-safe effectful state machines in Haskell

• in-other-words

  8.9 0.0 recursion-schemes VS in-other-words

  A higher-order effect system where the sky's the limit

Do you think we are missing an alternative of recursion-schemes or a related project?

InfluxDB - Power Real-Time Data Analytics at Scale

sponsored www.influxdata.com

Popular Comparisons

• recursion-schemes
  vs
  distributed-process-platform
• recursion-schemes
  vs
  machines
• recursion-schemes
  vs
  pipes-core
• recursion-schemes
  vs
  record
• recursion-schemes
  vs
  rank2classes

SaaSHub - Software Alternatives and Reviews

sponsored www.saashub.com