Learning Functional Programming in Go

Function composition is associative

So, function composition does not commute, but it is associative:

That diagram says that we can compose our functions to get from A to D by either choosing the upper (A→C→D) path or the lower (A→B→D) path.

The idea of a functor is that it translates the diagrams we can draw in one category into diagrams in another category. This often lets us convert ideas and theorems from one category into another.

Let's look at an example of a particular functor, the forgetful functor, to get a better feel for what it means to convert things from one category into another.