Put simply, .
is function composition, just like in math:
f (g x) = (f . g) x
In your case, you are creating a new function, sumEuler
that could also be defined like this:
sumEuler x = sum (map euler (mkList x))
The style in your example is called "point-free" style -- the arguments to the function are omitted. This makes for clearer code in many cases. (It can be hard to grok the first time you see it, but you will get used to it after a while. It is a common Haskell idiom.)
If you are still confused, it may help to relate .
to something like a UNIX pipe. If f
's output becomes g
's input, whose output becomes h
's input, you'd write that on the command-line like f < x | g | h
. In Haskell, .
works like the UNIX |
, but "backwards" -- h . g . f $ x
. I find this notation to be quite helpful when, say, processing a list. Instead of some unwieldy construction like map (x -> x * 2 + 10) [1..10]
, you could just write (+10) . (*2) <$> [1..10]
. (And, if you want to only apply that function to a single value; it's (+10) . (*2) $ 10
. Consistent!)
The Haskell wiki has a good article with some more detail: http://www.haskell.org/haskellwiki/Pointfree
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…