Control.Functor.Composition.Distributive

Documentation

class Covariant u => Distributive u where

Let f :: Distributive g => (a -> g b)

When providing a new instance, you should ensure it satisfies the two laws:
* Identity morphism: distribute . distribute ≡ identity
* Interchange collection: collect f ≡ distribute . comap f

Minimal complete definition

(>>-)

Methods

(>>-) :: Covariant t => t a -> (a -> u b) -> (u :.: t) b

Infix version of collect

collect :: Covariant t => (a -> u b) -> t a -> (u :.: t) b

Prefix version of >>-

distribute :: Covariant t => (t :.: u) a -> (u :.: t) a

The dual of sequence