folds-0.6.2: Beautiful Folding

Safe HaskellTrustworthy

Data.Fold.R

Synopsis

Documentation

data R a b Source

right folds / a reversed Moore machine

Constructors

forall r . R (r -> b) (a -> r -> r) r 

Instances

Profunctor R 
Choice R 
Folding R

leaky prefix, efficient postfix

Scan R 
AsRM R

We can convert from a lazy right fold to a monoidal fold

AsRM1 R 
Monad (R a) 
Functor (R a) 
Applicative (R a) 
MonadZip (R a) 
Comonad (R a) 
ComonadApply (R a) 
Apply (R a) 
Bind (R a) 
Extend (R a)