$ -parallel -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
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
Above, except that if the last line of the first argument stops at least one position before the first line of the second begins, these two lines are overlapped. For example: > text "hi" $$ nest 5 (text "there") lays out as > hi there rather than > hi > there $$ is associative, with identity empty, and also satisfies * (x $$ y) <> z = x $$ (y <> z), if y non-empty.
($$) :: Doc -> Doc -> Doc
template-haskell Language.Haskell.TH.PprLib
Above; if there is no overlap it "dovetails" the two
($+$) :: Doc -> Doc -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
Above, with no overlapping. $+$ is associative, with identity empty.
($+$) :: Doc -> Doc -> Doc
template-haskell Language.Haskell.TH.PprLib
Above, without dovetailing.
(<$) :: 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.