Recursion has always been a weird and demanding method to me. It just seemed odd to me to define something in terms of itself. But after spending some time with defining recursive functions, I've learned to love it.

While Haskell isn't famous for it's efficiency, sometimes we still want to measure how long the evaluation of an expression takes. This is a quick article on how to do so.

List comprehensions are one of my favourite features of Haskell. Just as recursion, list comprehension is a basic technique of functional programming and should be learned right in the beginning.

When you think about lists in general, you probably think about the grocery list you've written last week. Or about a list of your New Year's resolutions. Both lists have something in common, they store some data. This is a tutorial on how to use lists in Haskell.