Copyright | Nils Anders Danielsson 2006 |
---|---|
License | BSD-style (see the LICENSE file in the distribution) |
Maintainer | libraries@haskell.org |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Data.Function
Contents
- Prelude re-exports
- Other combinators
Description
Simple combinators working solely on and with functions.
Prelude re-exports
flip :: (a -> b -> c) -> b -> a -> c Source
takes its (first) two arguments in the reverse order of flip
ff
.
($) :: (a -> b) -> a -> b Source
Application operator. This operator is redundant, since ordinary
application (f x)
means the same as (f
. However, $
x)$
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
,
or map
($
0) xs
.zipWith
($
) fs xs
Other combinators
is the least fixed point of the function fix
ff
,
i.e. the least defined x
such that f x = x
.