$ -pretty -parsec

($) :: (a -> b) -> a -> b
base Prelude, base Data.Function
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.
($$) :: Doc -> Doc -> Doc
template-haskell Language.Haskell.TH.PprLib
Above; if there is no overlap it "dovetails" the two
($+$) :: Doc -> Doc -> Doc
template-haskell Language.Haskell.TH.PprLib
Above, without dovetailing.
($|) :: (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.