Control.Functor.Covariant.Composition.Bindable

Documentation

class Covariant t => Bindable t where

When providing a new instance, you should ensure it satisfies the one law:
* Interchange: t >>= f = join (f <$> t)

Minimal complete definition

(>>=)

Methods

(>>=) :: t a -> (a -> t b) -> t b infixl 1

Infix and flipped version of bind, the dual of =>>

(=<<) :: (a -> t b) -> t a -> t b infixr 1

Flipped version of >>=, the dual of <<=

bind :: (a -> t b) -> t a -> t b

Prefix and flipped version of >>=, the dual of extend

join :: (t :.: t) a -> t a

Merge effects/contexts, the dual of duplicate

(>=>) :: (a -> t b) -> (b -> t c) -> a -> t c infixr 1

Left-to-right Kleisli composition

(<=<) :: (b -> t c) -> (a -> t b) -> a -> t c infixr 1

Right-to-left Kleisli composition

Instances

Bindable Identity

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b

(=<<) :: (a -> Identity b) -> Identity a -> Identity b

bind :: (a -> Identity b) -> Identity a -> Identity b

join :: (Identity :.: Identity) a -> Identity a

(>=>) :: (a -> Identity b) -> (b -> Identity c) -> a -> Identity c

(<=<) :: (b -> Identity c) -> (a -> Identity b) -> a -> Identity c

Bindable t => Bindable (Yoneda t)

Defined in Data.Functor.Yoneda

Methods

(>>=) :: Yoneda t a -> (a -> Yoneda t b) -> Yoneda t b

(=<<) :: (a -> Yoneda t b) -> Yoneda t a -> Yoneda t b

bind :: (a -> Yoneda t b) -> Yoneda t a -> Yoneda t b

join :: (Yoneda t :.: Yoneda t) a -> Yoneda t a

(>=>) :: (a -> Yoneda t b) -> (b -> Yoneda t c) -> a -> Yoneda t c

(<=<) :: (b -> Yoneda t c) -> (a -> Yoneda t b) -> a -> Yoneda t c