This module describes a structure intermediate between a functor and
a monad: it provides pure expressions and sequencing, but no binding.
(Technically, a strong lax monoidal functor.) For more details, see
Applicative Programming with Effects,
by Conor McBride and Ross Paterson, online at
This interface was introduced for parsers by Niklas Röjemo, because
it admits more sharing than the monadic interface. The names here are
mostly based on recent parsing work by Doaitse Swierstra.
This class is also useful with instances of the
|class Functor f => Applicative f where|
|class Applicative f => Alternative f where|
|A monoid on applicative functors.
|empty :: f a|
|The identity of <|>
|(<|>) :: f a -> f a -> f a|
|An associative binary operation
|newtype Const a b|
|newtype WrappedMonad m a|
|newtype WrappedArrow a b c|
|newtype ZipList a|
|(<$>) :: Functor f => (a -> b) -> f a -> f b|
|A synonym for fmap.
|(<$) :: Functor f => a -> f b -> f a|
|Replace the value.
|(*>) :: Applicative f => f a -> f b -> f b|
|Sequence actions, discarding the value of the first argument.
|(<*) :: Applicative f => f a -> f b -> f a|
|Sequence actions, discarding the value of the second argument.
|(<**>) :: Applicative f => f a -> f (a -> b) -> f b|
|A variant of <*> with the arguments reversed.
|liftA :: Applicative f => (a -> b) -> f a -> f b|
|Lift a function to actions.
This function may be used as a value for fmap in a Functor instance.
|liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c|
|Lift a binary function to actions.
|liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d|
|Lift a ternary function to actions.
|optional :: Alternative f => f a -> f (Maybe a)|
|One or none.
|some :: Alternative f => f a -> f [a]|
|One or more.
|many :: Alternative f => f a -> f [a]|
|Zero or more.
|Produced by Haddock version 0.8|