Pandora.Pattern.Functor.Applicative

Documentation

class Covariant t => Applicative t where

When providing a new instance, you should ensure it satisfies the three laws:
* Composition: (.) <$> 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

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 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 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 (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

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

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 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 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 (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 (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 t => Applicative (Storage p t)

Defined in Pandora.Paradigm.Inventory.Storage

Methods

(<*>) :: Storage p t (a -> b) -> Storage p t a -> Storage p t b

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

(*>) :: Storage p t a -> Storage p t b -> Storage p t b

(<*) :: Storage p t a -> Storage p t b -> Storage p t a

forever :: Storage p t a -> Storage p t b

Bindable t => Applicative (Stateful s t)

Defined in Pandora.Paradigm.Inventory.Stateful

Methods

(<*>) :: Stateful s t (a -> b) -> Stateful s t a -> Stateful s t b

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

(*>) :: Stateful s t a -> Stateful s t b -> Stateful s t b

(<*) :: Stateful s t a -> Stateful s t b -> Stateful s t a

forever :: Stateful s t a -> Stateful s t 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 t => Applicative (Environmental e t)

Defined in Pandora.Paradigm.Inventory.Environmental

Methods

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

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

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

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

forever :: Environmental e t a -> Environmental e t b

(Applicative (t u), Applicative u) => Applicative (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

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

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

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

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

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

(Applicative t, Applicative u) => Applicative (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

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

(Applicative t, Applicative u) => Applicative (U Co Co t u)

Defined in Pandora.Paradigm.Junction.Composition

Methods

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

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

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

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

forever :: U Co Co t u a -> U Co Co t u b

(Applicative t, Applicative u, Applicative v) => Applicative (UU Co Co Co t u v)

Defined in Pandora.Paradigm.Junction.Composition

Methods

(<*>) :: UU Co Co Co t u v (a -> b) -> UU Co Co Co t u v a -> UU Co Co Co t u v b

apply :: UU Co Co Co t u v (a -> b) -> UU Co Co Co t u v a -> UU Co Co Co t u v b

(*>) :: UU Co Co Co t u v a -> UU Co Co Co t u v b -> UU Co Co Co t u v b

(<*) :: UU Co Co Co t u v a -> UU Co Co Co t u v b -> UU Co Co Co t u v a

forever :: UU Co Co Co t u v a -> UU Co Co Co t u v b

(Applicative t, Applicative u, Applicative v, Applicative w) => Applicative (UUU Co Co Co Co t u v w)

Defined in Pandora.Paradigm.Junction.Composition

Methods

(<*>) :: UUU Co Co Co Co t u v w (a -> b) -> UUU Co Co Co Co t u v w a -> UUU Co Co Co Co t u v w b

apply :: UUU Co Co Co Co t u v w (a -> b) -> UUU Co Co Co Co t u v w a -> UUU Co Co Co Co t u v w b

(*>) :: UUU Co Co Co Co t u v w a -> UUU Co Co Co Co t u v w b -> UUU Co Co Co Co t u v w b

(<*) :: UUU Co Co Co Co t u v w a -> UUU Co Co Co Co t u v w b -> UUU Co Co Co Co t u v w a

forever :: UUU Co Co Co Co t u v w a -> UUU Co Co Co Co t u v w b