This is just a test post to make sure that everything works fine.

I was very tempted to write about monads because that seems to be the thing to do in your first blog post. I really wanted to talk about how monads are implemented in Haskell and show this code:

class Monad m where
  return :: a -> m a
  (>>=)  :: m a -> (a -> m b) -> m b

But maybe it’s better to stick with a beautiful formula, generated with MathJax. For example this one here that tells us when a set \(M\) is finite:

\[ | M | < \infty \Leftrightarrow \bigwedge_{N \subsetneq M} |N| < |M|. \]

Built with Hakyll, MathJax, and Skeleton.