Pandora.Pattern.Functor.Applicative

Documentation

class Covariant t => Applicative t where

When providing a new instance, you should ensure it satisfies the three laws:
* Interpreted: (.) <$> u <*> v <*> w ≡ u <*> (v <*> w)
* Left interchange: x <*> (f <$> y) ≡ (. f) <$> x <*> y
* Right interchange: f <$> (x <*> y) ≡ (f .) <$> x <*> y

Minimal complete definition

(<*>)

Methods

(<*>) :: t (a -> b) -> t a -> t b infixl 4

Infix version of apply

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

Prefix version of <*>

(*>) :: t a -> t b -> t b infixl 4

Sequence actions, discarding the value of the first argument

(<*) :: t a -> t b -> t a infixl 4

Sequence actions, discarding the value of the second argument

forever :: t a -> t b

Repeat an action indefinitely

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

Infix versions of apply with various nesting levels

(<***>) :: (Applicative u, Applicative v) => ((t :. (u :. v)) := (a -> b)) -> ((t :. (u :. v)) := a) -> (t :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((t :. (u :. (v :. w))) := (a -> b)) -> ((t :. (u :. (v :. w))) := a) -> (t :. (u :. (v :. w))) := b

Instances

Applicative Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

forever :: Maybe a -> Maybe b

(<**>) :: Applicative u => ((Maybe :. u) := (a -> b)) -> ((Maybe :. u) := a) -> (Maybe :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Maybe :. (u :. v)) := (a -> b)) -> ((Maybe :. (u :. v)) := a) -> (Maybe :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Maybe :. (u :. (v :. w))) := (a -> b)) -> ((Maybe :. (u :. (v :. w))) := a) -> (Maybe :. (u :. (v :. w))) := b

Applicative Stack

Defined in Pandora.Paradigm.Structure.Specific.Stack

Methods

(<*>) :: Stack (a -> b) -> Stack a -> Stack b

apply :: Stack (a -> b) -> Stack a -> Stack b

(*>) :: Stack a -> Stack b -> Stack b

(<*) :: Stack a -> Stack b -> Stack a

forever :: Stack a -> Stack b

(<**>) :: Applicative u => ((Stack :. u) := (a -> b)) -> ((Stack :. u) := a) -> (Stack :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Stack :. (u :. v)) := (a -> b)) -> ((Stack :. (u :. v)) := a) -> (Stack :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Stack :. (u :. (v :. w))) := (a -> b)) -> ((Stack :. (u :. (v :. w))) := a) -> (Stack :. (u :. (v :. w))) := b

Applicative Identity

Defined in Pandora.Paradigm.Basis.Identity

Methods

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

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

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

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

forever :: Identity a -> Identity b

(<**>) :: Applicative u => ((Identity :. u) := (a -> b)) -> ((Identity :. u) := a) -> (Identity :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Identity :. (u :. v)) := (a -> b)) -> ((Identity :. (u :. v)) := a) -> (Identity :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Identity :. (u :. (v :. w))) := (a -> b)) -> ((Identity :. (u :. (v :. w))) := a) -> (Identity :. (u :. (v :. w))) := b

Applicative t => Applicative (Yoneda t)

Defined in Pandora.Paradigm.Basis.Yoneda

Methods

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

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

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

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

forever :: Yoneda t a -> Yoneda t b

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

(<***>) :: (Applicative u, Applicative v) => ((Yoneda t :. (u :. v)) := (a -> b)) -> ((Yoneda t :. (u :. v)) := a) -> (Yoneda t :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Yoneda t :. (u :. (v :. w))) := (a -> b)) -> ((Yoneda t :. (u :. (v :. w))) := a) -> (Yoneda t :. (u :. (v :. w))) := b

Applicative (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Basis.Proxy

Methods

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

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

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

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

forever :: Proxy a -> Proxy b

(<**>) :: Applicative u => ((Proxy :. u) := (a -> b)) -> ((Proxy :. u) := a) -> (Proxy :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Proxy :. (u :. v)) := (a -> b)) -> ((Proxy :. (u :. v)) := a) -> (Proxy :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Proxy :. (u :. (v :. w))) := (a -> b)) -> ((Proxy :. (u :. (v :. w))) := a) -> (Proxy :. (u :. (v :. w))) := b

Applicative (Environment e)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

(<*>) :: Environment e (a -> b) -> Environment e a -> Environment e b

apply :: Environment e (a -> b) -> Environment e a -> Environment e b

(*>) :: Environment e a -> Environment e b -> Environment e b

(<*) :: Environment e a -> Environment e b -> Environment e a

forever :: Environment e a -> Environment e b

(<**>) :: Applicative u => ((Environment e :. u) := (a -> b)) -> ((Environment e :. u) := a) -> (Environment e :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Environment e :. (u :. v)) := (a -> b)) -> ((Environment e :. (u :. v)) := a) -> (Environment e :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Environment e :. (u :. (v :. w))) := (a -> b)) -> ((Environment e :. (u :. (v :. w))) := a) -> (Environment e :. (u :. (v :. w))) := b

Covariant t => Applicative (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

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

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

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

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

forever :: Free t a -> Free t b

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

(<***>) :: (Applicative u, Applicative v) => ((Free t :. (u :. v)) := (a -> b)) -> ((Free t :. (u :. v)) := a) -> (Free t :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Free t :. (u :. (v :. w))) := (a -> b)) -> ((Free t :. (u :. (v :. w))) := a) -> (Free t :. (u :. (v :. w))) := b

Semigroup e => Applicative (Validation e)

Defined in Pandora.Paradigm.Basis.Validation

Methods

(<*>) :: Validation e (a -> b) -> Validation e a -> Validation e b

apply :: Validation e (a -> b) -> Validation e a -> Validation e b

(*>) :: Validation e a -> Validation e b -> Validation e b

(<*) :: Validation e a -> Validation e b -> Validation e a

forever :: Validation e a -> Validation e b

(<**>) :: Applicative u => ((Validation e :. u) := (a -> b)) -> ((Validation e :. u) := a) -> (Validation e :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Validation e :. (u :. v)) := (a -> b)) -> ((Validation e :. (u :. v)) := a) -> (Validation e :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Validation e :. (u :. (v :. w))) := (a -> b)) -> ((Validation e :. (u :. (v :. w))) := a) -> (Validation e :. (u :. (v :. w))) := b

Applicative t => Applicative (Twister t)

Defined in Pandora.Paradigm.Basis.Twister

Methods

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

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

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

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

forever :: Twister t a -> Twister t b

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

(<***>) :: (Applicative u, Applicative v) => ((Twister t :. (u :. v)) := (a -> b)) -> ((Twister t :. (u :. v)) := a) -> (Twister t :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Twister t :. (u :. (v :. w))) := (a -> b)) -> ((Twister t :. (u :. (v :. w))) := a) -> (Twister t :. (u :. (v :. w))) := b

Semigroup e => Applicative (Accumulator e)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

apply :: Accumulator e (a -> b) -> Accumulator e a -> Accumulator e b

(*>) :: Accumulator e a -> Accumulator e b -> Accumulator e b

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

forever :: Accumulator e a -> Accumulator e b

(<**>) :: Applicative u => ((Accumulator e :. u) := (a -> b)) -> ((Accumulator e :. u) := a) -> (Accumulator e :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Accumulator e :. (u :. v)) := (a -> b)) -> ((Accumulator e :. (u :. v)) := a) -> (Accumulator e :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Accumulator e :. (u :. (v :. w))) := (a -> b)) -> ((Accumulator e :. (u :. (v :. w))) := a) -> (Accumulator e :. (u :. (v :. w))) := b

Applicative (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

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

apply :: State s (a -> b) -> State s a -> State s b

(*>) :: State s a -> State s b -> State s b

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

forever :: State s a -> State s b

(<**>) :: Applicative u => ((State s :. u) := (a -> b)) -> ((State s :. u) := a) -> (State s :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((State s :. (u :. v)) := (a -> b)) -> ((State s :. (u :. v)) := a) -> (State s :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((State s :. (u :. (v :. w))) := (a -> b)) -> ((State s :. (u :. (v :. w))) := a) -> (State s :. (u :. (v :. w))) := b

Applicative t => Applicative (Jack t)

Defined in Pandora.Paradigm.Basis.Jack

Methods

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

apply :: Jack t (a -> b) -> Jack t a -> Jack t b

(*>) :: Jack t a -> Jack t b -> Jack t b

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

forever :: Jack t a -> Jack t b

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

(<***>) :: (Applicative u, Applicative v) => ((Jack t :. (u :. v)) := (a -> b)) -> ((Jack t :. (u :. v)) := a) -> (Jack t :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Jack t :. (u :. (v :. w))) := (a -> b)) -> ((Jack t :. (u :. (v :. w))) := a) -> (Jack t :. (u :. (v :. w))) := b

Applicative (Conclusion e)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

forever :: Conclusion e a -> Conclusion e b

(<**>) :: Applicative u => ((Conclusion e :. u) := (a -> b)) -> ((Conclusion e :. u) := a) -> (Conclusion e :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Conclusion e :. (u :. v)) := (a -> b)) -> ((Conclusion e :. (u :. v)) := a) -> (Conclusion e :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Conclusion e :. (u :. (v :. w))) := (a -> b)) -> ((Conclusion e :. (u :. (v :. w))) := a) -> (Conclusion e :. (u :. (v :. w))) := b

Applicative (Schema t u) => Applicative (t :> u)

Defined in Pandora.Paradigm.Controlflow.Joint.Transformer

Methods

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

apply :: (t :> u) (a -> b) -> (t :> u) a -> (t :> u) b

(*>) :: (t :> u) a -> (t :> u) b -> (t :> u) b

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

forever :: (t :> u) a -> (t :> u) b

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

(<***>) :: (Applicative u0, Applicative v) => (((t :> u) :. (u0 :. v)) := (a -> b)) -> (((t :> u) :. (u0 :. v)) := a) -> ((t :> u) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => (((t :> u) :. (u0 :. (v :. w))) := (a -> b)) -> (((t :> u) :. (u0 :. (v :. w))) := a) -> ((t :> u) :. (u0 :. (v :. w))) := b

Applicative (Tagged tag)

Defined in Pandora.Paradigm.Basis.Tagged

Methods

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

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

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

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

forever :: Tagged tag a -> Tagged tag b

(<**>) :: Applicative u => ((Tagged tag :. u) := (a -> b)) -> ((Tagged tag :. u) := a) -> (Tagged tag :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Tagged tag :. (u :. v)) := (a -> b)) -> ((Tagged tag :. (u :. v)) := a) -> (Tagged tag :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Tagged tag :. (u :. (v :. w))) := (a -> b)) -> ((Tagged tag :. (u :. (v :. w))) := a) -> (Tagged tag :. (u :. (v :. w))) := b

Applicative ((->) e :: Type -> Type)

Defined in Pandora.Pattern.Functor.Applicative

Methods

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

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

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

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

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

(<**>) :: Applicative u => (((->) e :. u) := (a -> b)) -> (((->) e :. u) := a) -> ((->) e :. u) := b

(<***>) :: (Applicative u, Applicative v) => (((->) e :. (u :. v)) := (a -> b)) -> (((->) e :. (u :. v)) := a) -> ((->) e :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => (((->) e :. (u :. (v :. w))) := (a -> b)) -> (((->) e :. (u :. (v :. w))) := a) -> ((->) e :. (u :. (v :. w))) := b

Covariant t => Applicative (Continuation r t)

Defined in Pandora.Paradigm.Basis.Continuation

Methods

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

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

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

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

forever :: Continuation r t a -> Continuation r t b

(<**>) :: Applicative u => ((Continuation r t :. u) := (a -> b)) -> ((Continuation r t :. u) := a) -> (Continuation r t :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Continuation r t :. (u :. v)) := (a -> b)) -> ((Continuation r t :. (u :. v)) := a) -> (Continuation r t :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Continuation r t :. (u :. (v :. w))) := (a -> b)) -> ((Continuation r t :. (u :. (v :. w))) := a) -> (Continuation r t :. (u :. (v :. w))) := b

Applicative u => Applicative (TU Co Co ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

(<*>) :: TU Co Co ((->) e) u (a -> b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

apply :: TU Co Co ((->) e) u (a -> b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

(*>) :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b -> TU Co Co ((->) e) u b

(<*) :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b -> TU Co Co ((->) e) u a

forever :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

(<**>) :: Applicative u0 => ((TU Co Co ((->) e) u :. u0) := (a -> b)) -> ((TU Co Co ((->) e) u :. u0) := a) -> (TU Co Co ((->) e) u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((TU Co Co ((->) e) u :. (u0 :. v)) := (a -> b)) -> ((TU Co Co ((->) e) u :. (u0 :. v)) := a) -> (TU Co Co ((->) e) u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((TU Co Co ((->) e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((TU Co Co ((->) e) u :. (u0 :. (v :. w))) := a) -> (TU Co Co ((->) e) u :. (u0 :. (v :. w))) := b

(Semigroup e, Applicative u) => Applicative (UT Co Co ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

apply :: UT Co Co ((:*:) e) u (a -> b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

(*>) :: UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b -> UT Co Co ((:*:) e) u b

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

forever :: UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

(<**>) :: Applicative u0 => ((UT Co Co ((:*:) e) u :. u0) := (a -> b)) -> ((UT Co Co ((:*:) e) u :. u0) := a) -> (UT Co Co ((:*:) e) u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Co Co ((:*:) e) u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co ((:*:) e) u :. (u0 :. v)) := a) -> (UT Co Co ((:*:) e) u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := b

Applicative u => Applicative (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

forever :: UT Co Co Maybe u a -> UT Co Co Maybe u b

(<**>) :: Applicative u0 => ((UT Co Co Maybe u :. u0) := (a -> b)) -> ((UT Co Co Maybe u :. u0) := a) -> (UT Co Co Maybe u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Co Co Maybe u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co Maybe u :. (u0 :. v)) := a) -> (UT Co Co Maybe u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co Maybe u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co Maybe u :. (u0 :. (v :. w))) := a) -> (UT Co Co Maybe u :. (u0 :. (v :. w))) := b

Applicative u => Applicative (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

(<**>) :: Applicative u0 => ((UT Co Co (Conclusion e) u :. u0) := (a -> b)) -> ((UT Co Co (Conclusion e) u :. u0) := a) -> (UT Co Co (Conclusion e) u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Co Co (Conclusion e) u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co (Conclusion e) u :. (u0 :. v)) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := b

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

Defined in Pandora.Paradigm.Inventory.State

Methods

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

apply :: TUV Co Co Co ((->) s) u ((:*:) s) (a -> b) -> TUV Co Co Co ((->) s) u ((:*:) s) 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 -> TUV Co Co Co ((->) s) u ((:*:) s) b

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

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

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

(<***>) :: (Applicative u0, Applicative v) => ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := (a -> b)) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := (a -> b)) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := b