Personal tools


From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
m (minor explanation)
(Composing functions with multiple values)
(7 intermediate revisions by 2 users not shown)

Latest revision as of 09:54, 3 January 2008

Currying is the process of transforming a function that takes multiple arguments into a function that takes just a single argument and returns another function if any arguments are still needed.

f :: a -> b -> c

is the curried form of

g :: (a, b) -> c
You can convert these two types in either directions with the Prelude functions
f = curry g
g = uncurry f

Both forms are equally expressive. It holds

f x y = g (x,y)    ,

however the curried form is usually more convenient because it allows partial application.

In Haskell, all functions are considered curried: That is, all functions in Haskell take just single arguments.

This is mostly hidden in notation, and so may not be apparent to a new Haskeller. Let's take the function
div :: Int -> Int -> Int
which performs integer division. The expression
div 11 2
unsurprisingly evaluates to
. But there's more that's going on than immediately meets the untrained eye. It's a two-part process. First,
div 11
is evaluated and returns a function of type
Int -> Int
Then that resulting function is applied to the value
, and yields
. You'll notice that the notation for types reflects this: you can read
Int -> Int -> Int
incorrectly as "takes two
s and returns an
", but what it's really saying is "takes an
and returns something of the type
Int -> Int
" -- that is, it returns a function that takes an
and returns an
. (One can write the type as
Int x Int -> Int
if you really mean the former -- but since all functions in Haskell are curried, that's not legal Haskell. Alternatively, using tuples, you can write
(Int, Int) -> Int
, but keep in mind that the tuple constructor
itself can be curried.)

Much of the time, currying can be ignored by the new programmer. The major advantage of considering all functions as curried is theoretical: formal proofs are easier when all functions are treated uniformly (one argument in, one result out). Having said that, there are Haskell idioms and techniques for which you need to understand currying.


[edit] Exercises

  • Simplify
    curry id
  • Simplify
    uncurry const
  • Express
    and other basic Prelude functions and without lambdas
  • Write the function
    \(x,y) -> (y,x)
    without lambda and with only Prelude functions