My Online Self
I used to think that making a layered coffee drink takes as much care as pouring a layered cocktail. Got a glass mug the other day and discovered that the process is pretty simple.
"Start donating to the authors of free and open source programs that I am using" was one of my failed New Year resolutions on multiple occasions. It is not anymore, and I hope this post will inspire you to follow suit.
The official Haskell wiki discusses literally dozens of ways to produce a list of prime numbers, but the one that caught my attention the other day is not listed there. Its centerpiece is a fold of a recursively defined infinite list of infinite lists (lists are lazy in Haskell). In this post, I've documented my attempt to rewrite it in Scala using streams.