| |||||||||||||

| |||||||||||||

| |||||||||||||

Description | |||||||||||||

Simple combinators working solely on and with functions. | |||||||||||||

Synopsis | |||||||||||||

| |||||||||||||

Prelude re-exports | |||||||||||||

id :: a -> a | |||||||||||||

Identity function. | |||||||||||||

const :: a -> b -> a | |||||||||||||

Constant function. | |||||||||||||

(.) :: (b -> c) -> (a -> b) -> a -> c | |||||||||||||

Function composition. | |||||||||||||

flip :: (a -> b -> c) -> b -> a -> c | |||||||||||||

takes its (first) two arguments in the reverse order of flip ff.
| |||||||||||||

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

Application operator. This operator is redundant, since ordinary
application $ 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 .
zipWith ($) fs xs | |||||||||||||

Other combinators | |||||||||||||

fix :: (a -> a) -> a | |||||||||||||

is the least fixed point of the function fix ff,
i.e. the least defined x such that f x = x.
| |||||||||||||

on :: (b -> b -> c) -> (a -> b) -> a -> a -> c | |||||||||||||

Typical usage: Algebraic properties: | |||||||||||||

Produced by Haddock version 0.8 |