$ -template-haskell -pretty

Application operator. This operator is redundant, since ordinary application (f x) means the same as (f $ x). However, $ has low, right-associative binding precedence, so it sometimes allows parentheses to be omitted; for example: > f $ g $ h x = f (g (h x)) It is also useful in higher-order situations, such as map ($ 0) xs, or Data.List.zipWith ($) fs xs.

($!) :: (a -> b) -> a -> b

base Prelude

Strict (call-by-value) application, defined in terms of seq.

($!!) :: NFData a => (a -> b) -> a -> b

deepseq Control.DeepSeq

the deep analogue of $!. In the expression f $!! x, x is fully evaluated before the function f is applied to it.

($|) :: (a -> b) -> Strategy a -> a -> b

parallel Control.Parallel.Strategies

Sequential function application. The argument is evaluated using the given strategy before it is given to the function.

($||) :: (a -> b) -> Strategy a -> a -> b

parallel Control.Parallel.Strategies

Parallel function application. The argument is evaluated using the given strategy, in parallel with the function application.

(<$) :: Functor f => a -> f b -> f a

base Data.Functor

(<$) :: Functor f => a -> f b -> f a

base Control.Applicative

Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

(<$>) :: Functor f => (a -> b) -> f a -> f b

base Data.Functor, base Control.Applicative

An infix synonym for fmap.

(<$$>) :: Stream s Identity tok => (a -> b) -> Parsec s st a -> StreamPermParser s st b

parsec Text.Parsec.Perm, parsec Text.ParserCombinators.Parsec.Perm

The expression f <$$> p creates a fresh permutation parser consisting of parser p. The the final result of the permutation parser is the function f applied to the return value of p. The parser p is not allowed to accept empty input - use the optional combinator (<$?>) instead. If the function f takes more than one parameter, the type variable b is instantiated to a functional type which combines nicely with the adds parser p to the (<||>) combinator. This results in stylized code permutation parser starts with a combining function f followed by the parsers. The function f gets its parameters in the order in which the parsers are specified, but actual input can be in any order.

(<$?>) :: Stream s Identity tok => (a -> b) -> (a, Parsec s st a) -> StreamPermParser s st b

parsec Text.Parsec.Perm, parsec Text.ParserCombinators.Parsec.Perm

The expression f <$?> (x,p) creates a fresh permutation parser consisting of parser p. The the final result of the permutation parser is the function f applied to the return value of p. The parser p is optional - if it can not be applied, the default value x will be used instead.