Pure Functions¶. An important idea in Haskell is the notion of a pure function. In Haskell, a function is said to be pure if it satisfies these two properties: It always returns the same result for ...

Instead, use a higher-order function to calculate the answer in one expression. In each of the following functions, x is a list of Int values, and the type of the returned value is also a list of Int.