Now you know a little about Recursion its time we use this knowledge for good - lets use it with a Haskell Favorite, Lists! How the list is built I’ve spoken about the List Data Type previously in the Haskell for Beginners: Lists and Comprehensions post, but we need to know a little more about them before we can apply our newly found recursive knowledge to them. A list is build not made, let me explain.

I’ve got a good post in store today, High Order Functions, one of my Haskell favourites. We’ve previously covered, List Comprehensions and Recursion for getting stuff done in Haskell, now we will be covering a slightly more advanced topic, but one I find very cool. Why so high? You might be asking yourself, why these functions are so high? I’ll first explain what exactly is a high order function as you may have not encountered them before.