Pandora.Pattern.Functor.Bindable

Documentation

class Covariant source source t => Bindable source t where

When providing a new instance, you should ensure it satisfies :
* Interchange: t >>= f = join (f <-|- t)

Minimal complete definition

(=<<)

Methods

(=<<) :: source a (t b) -> source (t a) (t b) infixr 7

(==<<) :: source a (t b) -> source (t a) (t b) infixr 6

(===<<) :: source a (t b) -> source (t a) (t b) infixr 5

(====<<) :: source a (t b) -> source (t a) (t b) infixr 4

(=====<<) :: source a (t b) -> source (t a) (t b) infixr 3

(======<<) :: source a (t b) -> source (t a) (t b) infixr 2

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

Instances

Bindable ((->) :: Type -> Type -> Type) Exactly

Defined in Pandora.Paradigm.Primary.Functor.Exactly

Methods

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

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

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

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

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

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

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

Bindable ((->) :: Type -> Type -> Type) Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

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

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

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

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

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

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

Bindable ((->) :: Type -> Type -> Type) (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Proxy

Methods

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

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

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

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

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

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

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

(Monoidal (-->) (-->) (:*:) (:*:) t, Bindable ((->) :: Type -> Type -> Type) t) => Bindable ((->) :: Type -> Type -> Type) (Jack t)

Defined in Pandora.Paradigm.Primary.Transformer.Jack

Methods

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

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

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

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

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

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

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

Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t => Bindable ((->) :: Type -> Type -> Type) (Instruction t)

Defined in Pandora.Paradigm.Primary.Transformer.Instruction

Methods

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

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

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

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

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

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

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

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

(forall a. Semigroup ((t <::> Construction t) >>>>> a), Bindable ((->) :: Type -> Type -> Type) t) => Bindable ((->) :: Type -> Type -> Type) (Comprehension t)

Defined in Pandora.Paradigm.Structure.Modification.Comprehension

Methods

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

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

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

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

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

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

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

Bindable ((->) :: Type -> Type -> Type) (State s)

Defined in Pandora.Paradigm.Inventory.Some.State

Methods

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Inventory.Some.Provision

Methods

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

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

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

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

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

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

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

Semigroup e => Bindable ((->) :: Type -> Type -> Type) (Accumulator e)

Defined in Pandora.Paradigm.Inventory.Some.Accumulator

Methods

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

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

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

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

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

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

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

Bindable ((->) :: Type -> Type -> Type) (Tagged tag)

Defined in Pandora.Paradigm.Primary.Functor.Tagged

Methods

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

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

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

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

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

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

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

Bindable ((->) :: Type -> Type -> Type) (Schematic Monad t u) => Bindable ((->) :: Type -> Type -> Type) (t :> u)

Defined in Pandora.Paradigm.Controlflow.Effect.Transformer.Monadic

Methods

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

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

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

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

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

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

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

Bindable ((->) :: Type -> Type -> Type) (Schematic Comonad t u) => Bindable ((->) :: Type -> Type -> Type) (t :< u)

Defined in Pandora.Paradigm.Controlflow.Effect.Transformer.Comonadic

Methods

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Algebraic.Exponential

Methods

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

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

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

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

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

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

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

Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t => Bindable ((->) :: Type -> Type -> Type) (Continuation r t)

Defined in Pandora.Paradigm.Primary.Transformer.Continuation

Methods

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

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

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

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

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

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

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

(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t', Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t, Bindable ((->) :: Type -> Type -> Type) u) => Bindable ((->) :: Type -> Type -> Type) ((t <:<.>:> t') >>>>>>>> u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(=<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(==<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(===<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(====<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(=====<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(======<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(=======<<) :: (a -> ((t <:<.>:> t') >>>>>>>> u) b) -> ((t <:<.>:> t') >>>>>>>> u) a -> ((t <:<.>:> t') >>>>>>>> u) b

(Traversable ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Bindable ((->) :: Type -> Type -> Type) t, Semimonoidal (-->) (:*:) (:*:) u, Monoidal (-->) (-->) (:*:) (:*:) u, Bindable ((->) :: Type -> Type -> Type) u) => Bindable ((->) :: Type -> Type -> Type) (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

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

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

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

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

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

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

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

(Bindable ((->) :: Type -> Type -> Type) t, Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u, Bindable ((->) :: Type -> Type -> Type) u) => Bindable ((->) :: Type -> Type -> Type) (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

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

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

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

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

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

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

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

(Bindable ((->) :: Type -> Type -> Type) t, Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t', Bindable ((->) :: Type -> Type -> Type) t') => Bindable ((->) :: Type -> Type -> Type) (t <::> t')

Defined in Pandora.Paradigm.Schemes.TT

Methods

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

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

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

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

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

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

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