In this article I will give a brief overview of what a monad is. Later articles in this series will use monadic features in different programming examples, therefore I thought it would be a good idea to first give an overview of what a monad is. I will use metaphors to explain the concept, and I will not give any code examples in this article.
3 min read
By Ragnhild Aalvik
December 5, 2019
I'm sure most of you are already using monads, even without knowing it. You see, monads are hidden behind various names in different programming languages.
Lists are all examples of monads. :exploding_head:
A monad is a concept that belongs to a branch of mathematics called category theory, where it was introduced in the 1960s. It wasn't until the 1990s that monads were found useful in programming. In category theory, a monad can be defined like this:
"Definition 1. A monad over a category C is a triple (T,η,µ) where T : C → C is a functor, η : idC → T and µ : T2 → T are natural transformations such that:
µA ◦ TµA = µA ◦ µTA\ µA ◦ ηTA = idTA = µA ◦ TηA"
This is probably pretty incomprehensible if you're not familiar with category theory. Luckily it is not needed for understanding and using monads in the context of programming. I just wanted to show the formal definition before moving to the more tangible way of talking about monads in the following section.
To understand monads, either you have studied category theory or not, we need to concretize them with metaphors. We simply cannot think about such abstract concepts without introducing some sort of metaphor. In this section I will explain one of the most common metaphors for monads, namely a monad as a container.
A monad can be seen as a container around some value, along with operations on that value. Concretely, in programming we can think of a monad as a datatype with two operations:
>>= (pronounced bind) and
A little simplified,
>>= takes a container with a value inside, applies a function to the value, and puts the new value back in the container.
return takes a value and puts it in a container. One concrete example of a container monad is
Maybe is a datatype that either contains a value (
Just x) or it is empty (
Nothing). To do operations on a
Maybe value, we must first check if the value is present or not. This makes it tedious to compose operations on a
Maybe, as we need to unwrap the value for every step. This is where our monadic friend
>>= comes in handy, as it lets us compose functions on monadic values, such as
Was this all a little too fluffy to grasp? I agree, therefore I recommend checking out this awesome visualization of how we work with monads in programming. I hope this gave you a little intuition for what monads are, and that it helps when they return in later articles.
And remember, a monad is just a monoid in the category of endofunctors, what's the big deal 😉