Pandora.Pattern.Functor.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 Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

Bindable Identity

Defined in Pandora.Paradigm.Basis.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 (Environmental e)

Defined in Pandora.Paradigm.Inventory.Environmental

Methods

(>>=) :: Environmental e a -> (a -> Environmental e b) -> Environmental e b

(=<<) :: (a -> Environmental e b) -> Environmental e a -> Environmental e b

bind :: (a -> Environmental e b) -> Environmental e a -> Environmental e b

join :: ((Environmental e :. Environmental e) > a) -> Environmental e a

(>=>) :: (a -> Environmental e b) -> (b -> Environmental e c) -> a -> Environmental e c

(<=<) :: (b -> Environmental e c) -> (a -> Environmental e b) -> a -> Environmental e c

Bindable (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Basis.Proxy

Methods

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

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

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

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

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

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

Covariant t => Bindable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

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

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

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

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

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

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

Alternative t => Bindable (Twister t)

Defined in Pandora.Paradigm.Basis.Twister

Methods

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

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

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

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

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

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

Bindable (Stateful s)

Defined in Pandora.Paradigm.Inventory.Stateful

Methods

(>>=) :: Stateful s a -> (a -> Stateful s b) -> Stateful s b

(=<<) :: (a -> Stateful s b) -> Stateful s a -> Stateful s b

bind :: (a -> Stateful s b) -> Stateful s a -> Stateful s b

join :: ((Stateful s :. Stateful s) > a) -> Stateful s a

(>=>) :: (a -> Stateful s b) -> (b -> Stateful s c) -> a -> Stateful s c

(<=<) :: (b -> Stateful s c) -> (a -> Stateful s b) -> a -> Stateful s c

Bindable (Conclusion e)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(>>=) :: Conclusion e a -> (a -> Conclusion e b) -> Conclusion e b

(=<<) :: (a -> Conclusion e b) -> Conclusion e a -> Conclusion e b

bind :: (a -> Conclusion e b) -> Conclusion e a -> Conclusion e b

join :: ((Conclusion e :. Conclusion e) > a) -> Conclusion e a

(>=>) :: (a -> Conclusion e b) -> (b -> Conclusion e c) -> a -> Conclusion e c

(<=<) :: (b -> Conclusion e c) -> (a -> Conclusion e b) -> a -> Conclusion e c

Bindable (Tagged tag)

Defined in Pandora.Paradigm.Basis.Tagged

Methods

(>>=) :: Tagged tag a -> (a -> Tagged tag b) -> Tagged tag b

(=<<) :: (a -> Tagged tag b) -> Tagged tag a -> Tagged tag b

bind :: (a -> Tagged tag b) -> Tagged tag a -> Tagged tag b

join :: ((Tagged tag :. Tagged tag) > a) -> Tagged tag a

(>=>) :: (a -> Tagged tag b) -> (b -> Tagged tag c) -> a -> Tagged tag c

(<=<) :: (b -> Tagged tag c) -> (a -> Tagged tag b) -> a -> Tagged tag c

Bindable ((->) e :: Type -> Type)

Defined in Pandora.Pattern.Functor.Bindable

Methods

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

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

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

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

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

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

Covariant t => Bindable (Continuation r t)

Defined in Pandora.Paradigm.Basis.Continuation

Methods

(>>=) :: Continuation r t a -> (a -> Continuation r t b) -> Continuation r t b

(=<<) :: (a -> Continuation r t b) -> Continuation r t a -> Continuation r t b

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

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

(>=>) :: (a -> Continuation r t b) -> (b -> Continuation r t c) -> a -> Continuation r t c

(<=<) :: (b -> Continuation r t c) -> (a -> Continuation r t b) -> a -> Continuation r t c

(Pointable u, Bindable u) => Bindable (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(>>=) :: UT Co Co Maybe u a -> (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u b

(=<<) :: (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

bind :: (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

join :: ((UT Co Co Maybe u :. UT Co Co Maybe u) > a) -> UT Co Co Maybe u a

(>=>) :: (a -> UT Co Co Maybe u b) -> (b -> UT Co Co Maybe u c) -> a -> UT Co Co Maybe u c

(<=<) :: (b -> UT Co Co Maybe u c) -> (a -> UT Co Co Maybe u b) -> a -> UT Co Co Maybe u c

(Pointable u, Bindable u) => Bindable (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(>>=) :: UT Co Co (Conclusion e) u a -> (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u b

(=<<) :: (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

bind :: (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

join :: ((UT Co Co (Conclusion e) u :. UT Co Co (Conclusion e) u) > a) -> UT Co Co (Conclusion e) u a

(>=>) :: (a -> UT Co Co (Conclusion e) u b) -> (b -> UT Co Co (Conclusion e) u c) -> a -> UT Co Co (Conclusion e) u c

(<=<) :: (b -> UT Co Co (Conclusion e) u c) -> (a -> UT Co Co (Conclusion e) u b) -> a -> UT Co Co (Conclusion e) u c

Bindable u => Bindable (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s))

Defined in Pandora.Paradigm.Inventory.Stateful

Methods

(>>=) :: TUV Co Co Co ((->) s) u ((:*:) s) a -> (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> TUV Co Co Co ((->) s) u ((:*:) s) b

(=<<) :: (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

bind :: (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

join :: ((TUV Co Co Co ((->) s) u ((:*:) s) :. TUV Co Co Co ((->) s) u ((:*:) s)) > a) -> TUV Co Co Co ((->) s) u ((:*:) s) a

(>=>) :: (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> (b -> TUV Co Co Co ((->) s) u ((:*:) s) c) -> a -> TUV Co Co Co ((->) s) u ((:*:) s) c

(<=<) :: (b -> TUV Co Co Co ((->) s) u ((:*:) s) c) -> (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> a -> TUV Co Co Co ((->) s) u ((:*:) s) c