Monthly Archives: March 2014

In July 2003, I wrote a blog post titled “An Excel VBA macro that solves MasterMind”. In that blog post, I presented a program that solved MasterMind. I wrote the program in VBA and it runs inside Excel. It is … Continue reading →

We first encountered trees in Haskell in my blog post titled “Trees in Haskell”. In that blog post we studied binary trees. Then we continued our study of binary trees in my blog post titled “Examples of Functors in Haskell”. … Continue reading →

If you have read my blog posts so far, you will have understood the difference between normal function application in Haskell and the monadic bind (>>=). What I essentially talk about, is the difference between f x and x >>= … Continue reading →

Like Maybe, [] is also a type constructor elevated into a Functor, Applicative, and Monad. The code that turns [] into a Functor follows: instance Functor [] where    fmap = map The previous code can be written equivalently: instance … Continue reading →

Maybe is predefined and built in Haskell. Maybe is a type constructor whose definition is built-in as: data Maybe a = Nothing | Just a Its meaning as a type constructor is that Maybe accommodates cases where there might be … Continue reading →

As I understand it, Oppia.org, a project made by Google engineers, is about adaptive learning. Since there is a lot of merit in such an approach and since I am already familiar with such an approach from Microsoft’s exams, I … Continue reading →