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 ...

Haskell uses a lazy evaluation system which allows you define as many terms as you like, ... and those based on the built in scanl function (for the list comprehension examples, ...

Stick to basic recursion and Haskell prelude functions for your solution code. Make sure to give the most general type signatures for each of the functions. (1 mark) Implement append A B, that returns ...