Data.Utils.Arrow

This module defines utility functions for arrows.

Documentation

class Arrow a => ArrowConvolve a where

Arrows implementing ArrowConvolve can be mapped over containers. This means that every functor (f :: Hask -> Hask) lifts to a functor (a -> a).

Instances should satisfy the following laws:

• convolve id = id

• convolve (g . h) = convolve g . convolve h

• convolve . arr = arr . fmap

Minimal complete definition

convolve

Methods

convolve :: forall f b c. Functor f => a b c -> a (f b) (f c)

Instances

ArrowConvolve (ParamFun s t)

Methods

convolve :: Functor f => ParamFun s t b c -> ParamFun s t (f b) (f c)

fmapArr :: Arrow a => (c -> d) -> a b c -> a b d

A function suitable to define the canonical Functor instance for arrows.

pureArr :: Arrow a => c -> a b c

A function to define pure for arrows. Combining this with apArr, the canonical Applicative instance for arrows can easily be defined.

apArr :: Arrow a => a b (c -> d) -> a b c -> a b d

A function to define (<*>) for arrows. Combining this with pureArr, the canonical Applicative instance for arrows can easily be defined.

dimapArr :: Arrow a => (b -> c) -> (d -> e) -> a c d -> a b e

A function suitable to define the canonical Profunctor instance for arrows.