This article aims to be a brief practical introduction to new haskell programmer about the fold high order function (which roughly speaking is a function that takes as input and/or produces as output a function) and its usage. It will also outline a bit of the theory that lies behind this operator (the term operator comes from the field of recursion theory (Kleene, 1952), even if, striclty speaking fold is a function in haskell).
Haskell Fold - Introduction and formal definition
Many problem in function programming are solved by means of tail recursive functions (one that do not perform any other operations that need some values from the recursive call). For instance let's say we want to get the product of integers stored in a list.
What we would do is to write down a tail recursive function (more or less) like this
tailmultiply :: [Int] -> Int -> Int tailmultiply  acc = acc tailmultiply (x:xs) acc = tailmultiply xs (acc * x)
Note, to stress the tail recursion, a definition like the one that follows would not be tail recursive.