Please log in to watch this conference skillscast.

One of the great things about Haskell is the way it enables us to recognize patterns, give them names, and reuse them. It's been noted before that monoids really are everywhere in programming, but that Haskell gives us more ability to see them than many languages do.

During this talk, you will explore a bit of background in Boolean algebra, focusing on the two fundamental operations, which are generalizations of addition and multiplication, and their identity elements. Julie will extend this to the Monoid typeclass in Haskell and illuminate those Boolean patterns over various types.

Julie will then extend this further, and you will discover how to examine the monoids of conjunction that typically underlie applicative functors and the monoids of disjunction that you find in the Alternative typeclass.

YOU MAY ALSO LIKE:

• Coding, common vulnerabilities, fixing them and a spot of IoT (in London on 19th February 2019)
• Alberto Brandolini's DDD Modelling Workshop (in London on 13th - 15th November 2019)