Dot Operator in Haskell: need more explanation

by

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

More Related Contents:

  1. What is the difference between . (dot) and $ (dollar sign)?
  2. Why shouldn’t I mix tabs and spaces?
  3. runST and function composition
  4. What does (f .) . g mean in Haskell?
  5. What does the “@” symbol mean in reference to lists in Haskell?
  6. Haskell function composition (.) and function application ($) idioms: correct use
  7. What does $ mean/do in Haskell?
  8. What’s the “|” for in a Haskell class definition?
  9. What does the exclamation mark mean in a Haskell declaration?
  10. Haskell function composition operator of type (c→d) → (a→b→c) → (a→b→d)
  11. What does the `forall` keyword in Haskell/GHC do?
  12. What characters are permitted for Haskell operators?
  13. Converting IO Int to Int
  14. Good examples of Not a Functor/Functor/Applicative/Monad?
  15. Defining a function by equations with different number of arguments
  16. :sprint for polymorphic values?
  17. Multi-line commands in GHCi
  18. Haskell: Lists, Arrays, Vectors, Sequences
  19. What are “n+k patterns” and why are they banned from Haskell 2010?
  20. How do I write, “if typeclass a, then a is also an instance of b by this definition.”
  21. Applicative functor evaluation is not clear to me
  22. Expressing do block using only monadic bind syntax
  23. Why do we need monads?
  24. What constitutes a fold for types other than list?
  25. How to interpret bind/>>= of the function instance?
  26. Why should Applicative be a superclass of Monad?
  27. Comparing Haskell’s Snap and Yesod web frameworks
  28. how to implement doubly linked lists
  29. How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)?
  30. Is there a built-in function to get all consecutive subsequences of size n of a list in Haskell?

Leave a Comment