Pandora.Pattern.Functor.Applicative

Documentation

class Covariant t => Applicative t where

When providing a new instance, you should ensure it satisfies:
* 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

(<%>) :: t a -> t (a -> b) -> t b

Flipped version of <*>

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

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 infixl 2

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

Instances

Applicative Identity

Defined in Pandora.Paradigm.Primary.Functor.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

(<%>) :: Identity a -> Identity (a -> b) -> 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 Maybe

Defined in Pandora.Paradigm.Primary.Functor.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

(<%>) :: Maybe a -> Maybe (a -> b) -> 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 (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.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

(<%>) :: Proxy a -> Proxy (a -> b) -> 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

Semigroup e => Applicative (Validation e)

Defined in Pandora.Paradigm.Primary.Functor.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

(<%>) :: Validation e a -> Validation e (a -> b) -> 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 (Yoneda t)

Defined in Pandora.Paradigm.Primary.Transformer.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

(<%>) :: Yoneda t a -> Yoneda t (a -> b) -> 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 t => Applicative (Jack t)

Defined in Pandora.Paradigm.Primary.Transformer.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

(<%>) :: Jack t a -> Jack t (a -> b) -> 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 (Outline f)

Defined in Pandora.Paradigm.Primary.Transformer.Outline

Methods

(<*>) :: Outline f (a -> b) -> Outline f a -> Outline f b

apply :: Outline f (a -> b) -> Outline f a -> Outline f b

(*>) :: Outline f a -> Outline f b -> Outline f b

(<*) :: Outline f a -> Outline f b -> Outline f a

forever :: Outline f a -> Outline f b

(<%>) :: Outline f a -> Outline f (a -> b) -> Outline f b

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

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

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

Covariant t => Applicative (Instruction t)

Defined in Pandora.Paradigm.Primary.Transformer.Instruction

Methods

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

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

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

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

forever :: Instruction t a -> Instruction t b

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

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

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

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

Applicative t => Applicative (Construction t)

Defined in Pandora.Paradigm.Primary.Transformer.Construction

Methods

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

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

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

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

forever :: Construction t a -> Construction t b

(<%>) :: Construction t a -> Construction t (a -> b) -> Construction t b

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

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

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

Applicative (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.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

(<%>) :: Conclusion e a -> Conclusion e (a -> b) -> 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

(forall a. Semigroup ((t <:.> Construction t) := a), Bindable t, Pointable t, Avoidable t) => Applicative (Comprehension t)

Defined in Pandora.Paradigm.Structure.Modification.Comprehension

Methods

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

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

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

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

forever :: Comprehension t a -> Comprehension t b

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

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

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

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

Applicative t => Applicative (Tap t)

Defined in Pandora.Paradigm.Primary.Transformer.Tap

Methods

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

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

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

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

forever :: Tap t a -> Tap t b

(<%>) :: Tap t a -> Tap t (a -> b) -> Tap t b

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

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

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

Applicative (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(<*>) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) (a -> b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

apply :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) (a -> b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(*>) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(<*) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a

forever :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(<%>) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) (a -> b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

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

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

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

Applicative (Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(<*>) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) (a -> b) -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

apply :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) (a -> b) -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(*>) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(<*) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a

forever :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(<%>) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) (a -> b) -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

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

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

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

Applicative (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(<*>) :: Tap ((List <:.:> List) := (:*:)) (a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

apply :: Tap ((List <:.:> List) := (:*:)) (a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

(*>) :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b -> Tap ((List <:.:> List) := (:*:)) b

(<*) :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b -> Tap ((List <:.:> List) := (:*:)) a

forever :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

(<%>) :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) (a -> b) -> Tap ((List <:.:> List) := (:*:)) b

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

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

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Tap ((List <:.:> List) := (:*:)) :. (u :. (v :. w))) := (a -> b)) -> ((Tap ((List <:.:> List) := (:*:)) :. (u :. (v :. w))) := a) -> (Tap ((List <:.:> List) := (:*:)) :. (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

(<%>) :: State s a -> State s (a -> b) -> 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 (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

(<%>) :: Environment e a -> Environment e (a -> b) -> 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

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

(<%>) :: Accumulator e a -> Accumulator e (a -> b) -> 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 (Tagged tag)

Defined in Pandora.Paradigm.Primary.Functor.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

(<%>) :: Tagged tag a -> Tagged tag (a -> b) -> 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 (Schematic Monad t u) => Applicative (t :> u)

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

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

(<%>) :: (t :> u) a -> (t :> u) (a -> b) -> (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 t, Applicative u) => Applicative (Day t u)

Defined in Pandora.Paradigm.Primary.Transformer.Day

Methods

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

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

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

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

forever :: Day t u a -> Day t u b

(<%>) :: Day t u a -> Day t u (a -> b) -> Day t u b

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

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

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

Applicative t => Applicative (Backwards t)

Defined in Pandora.Paradigm.Primary.Transformer.Backwards

Methods

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

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

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

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

forever :: Backwards t a -> Backwards t b

(<%>) :: Backwards t a -> Backwards t (a -> b) -> Backwards t b

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

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

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

Applicative t => Applicative (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

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

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

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

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

forever :: Reverse t a -> Reverse t b

(<%>) :: Reverse t a -> Reverse t (a -> b) -> Reverse t b

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

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

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

Applicative (Schematic Comonad t u) => Applicative (t :< u)

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

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

(<%>) :: (t :< u) a -> (t :< u) (a -> b) -> (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 ((->) e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Function

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

(<%>) :: (e -> a) -> (e -> (a -> b)) -> 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.Primary.Transformer.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

(<%>) :: Continuation r t a -> Continuation r t (a -> b) -> 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 t => Applicative ((t <:.:> t) := (:*:))

Defined in Pandora.Paradigm.Primary.Functor.Product

Methods

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

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

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

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

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

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

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

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

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

(Adjoint t' t, Bindable u) => Applicative ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

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

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

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

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

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

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

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

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

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

(Applicative t, Applicative u) => Applicative (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

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

(<%>) :: (t <.:> u) a -> (t <.:> u) (a -> b) -> (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

(Semigroup e, Applicative u) => Applicative ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

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

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

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

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

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

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

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

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

(Applicative t, Applicative u) => Applicative (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

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

(<%>) :: (t <:.> u) a -> (t <:.> u) (a -> b) -> (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