morphisms-functors-0.1.2: Functors, theirs compositions and transformations

Safe HaskellSafe
LanguageHaskell2010

Control.Functor.Composition.Bindable

Synopsis

Documentation

class Covariant t => Bindable t where Source #

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 Source #

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

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

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

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

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

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

Merge effects/contexts, the dual of duplicate