Please log in to watch this conference skillscast.
This talk introduces string diagrams as a notation for calculating in category theory. You will learn the diagrams to better understand monads, adjunctions, and finally free monads. All of this, of course, is relevant to the curious Haskell programmer who wants to better understand abstract nonsense.
The Call for Papers is now open for Haskell eXchange 2017! Submit your talk for the chance to join a stellar line-up of experts on stage. Find out more.
YOU MAY ALSO LIKE:
- FullStack Bytes with Jolyon Russ! (in London on 25th October 2017)
- F# eXchange 2018 (in London on 5th - 6th April 2018)
Categories and String Diagrams
Nick has been using Haskell since 2001 while he was an undergraduate at the University of Oxford, where he also obtained his doctorate in Computer Science. He then went to work as a Haskell consultant at Well-Typed LLP before returning to academia. As a postdoctoral researcher he worked principally on unifying the foundations of recursion schemes using category theory. He is currently a lecturer at the University of Bristol, and continues to work on recursion schemes, as well as effect handlers and domain specific languages.