<

(<) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(<=) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(<$) :: 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.
(<*) :: Applicative f => f a -> f b -> f a
base Control.Applicative
(<**>) :: Applicative f => f a -> f (a -> b) -> f b
base Control.Applicative
A variant of <*> with the arguments reversed.
(<*>) :: Applicative f => f (a -> b) -> f a -> f b
base Control.Applicative
(<++) :: ReadP a -> ReadP a -> ReadP a
base Text.ParserCombinators.ReadP
Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.
(<++) :: ReadPrec a -> ReadPrec a -> ReadPrec a
base Text.ParserCombinators.ReadPrec
Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.
(<+>) :: ArrowPlus a => a b c -> a b c -> a b c
base Control.Arrow
(<<<) :: Category cat => cat b c -> cat a b -> cat a c
base Control.Category, base Control.Arrow
Right-to-left composition
(<<^) :: Arrow a => a c d -> (b -> c) -> a b d
base Control.Arrow
Precomposition with a pure function (right-to-left variant).
(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> (a -> m c)
base Control.Monad
Right-to-left Kleisli composition of monads. (>=>), with the arguments flipped
(<|>) :: Alternative f => f a -> f a -> f a
base Control.Applicative
(<$$>) :: 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.
(<+>) :: Doc -> Doc -> Doc
template-haskell Language.Haskell.TH.PprLib
Beside, separated by space
(<+>) :: Doc -> Doc -> Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
Beside, separated by space, unless one of the arguments is empty. <+> is associative, with identity empty.
keyword <-
keyword
*  In do-notation, "draw from": > do x

Show more results