Popularity
0.8
Declining
Activity
0.0
Stable
0
1
0
Monthly Downloads: 11
Programming language: Haskell
License: BSD 3-clause "New" or "Revised" License
Latest version: v0.1.11.0
monadic-recursion-schemes alternatives and similar packages
Based on the "Control" category.
Alternatively, view monadic-recursion-schemes alternatives based on common mentions on social networks and blogs.
-
fused-effects
A fast, flexible, fused effect system for Haskell -
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) -
apecs
a fast, extensible, type driven Haskell ECS framework for games -
recursion-schemes
Generalized bananas, lenses and barbed wire -
capability
Extensional capabilities and deriving combinators -
distributed-closure
Serializable closures for distributed programming. -
selective
Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically -
classy-prelude-yesod
Type classes for mapping, folding, and traversing monomorphic containers -
auto
Haskell DSL and platform providing denotational, compositional api for discrete-step, locally stateful, interactive programs, games & automations. http://hackage.haskell.org/package/auto -
hask
Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!) -
safe-exceptions
Safe, consistent, and easy exception handling -
extensible-effects
Extensible Effects: An Alternative to Monad Transformers -
classy-prelude
Type classes for mapping, folding, and traversing monomorphic containers -
ComonadSheet
A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comonads. -
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 -
abstract-par
Type classes generalizing the functionality of the 'monad-par' library. -
these
An either-or-both data type, with corresponding hybrid error/writer monad transformer. -
unliftio
The MonadUnliftIO typeclass for unlifting monads to IO -
retry
Retry combinators for monadic actions that may fail -
distributed-fork
A distributed data processing framework in Haskell. -
cloud-haskell
This is an umbrella development repository for Cloud Haskell -
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 -
monad-validate
A Haskell monad transformer library for data validation -
monad-control
Lift control operations, like exception catching, through monad transformers -
monad-time
Type class for monads which carry the notion of the current time. -
operational
Implement monads by specifying instructions and their desired operational semantics. -
ixmonad
Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects. -
effect-monad
Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects. -
lens-tutorial
The missing tutorial module for the lens library -
freer-effects
An implementation of "Freer Monads, More Extensible Effects".
Static code analysis for 29 languages.
Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.
Promo
www.sonarqube.org
Do you think we are missing an alternative of monadic-recursion-schemes or a related project?
README
Recursion Schemes for Monadic version
Overview
The Monad version of recursion schemes is provided. This library strongly relies on recursion-schemes.
We also provide multiple variants for some, but not all, morphisms. Such variants may have a single prime or two or more consecutive primes at the end of the function name, and may be of different types, but they are essentially the same.