A different way to do concurrency — Haskell’s STM monad by Elisabeth Stenholm

Elisabeth Stenholm explains Software Transactional Memory in Haskell as an alternative to lock-based concurrency.

Looking for a way to do concurrency without locks? Then you have come to the right talk. Software Transactional Memory (STM) is an abstraction that allows the programmer to write lockless, concurrent code that is safe and composable. During this talk I will explain what STM is and what it can do, with code examples implemented in Haskell’s STM monad. We will see its strengths as well as its weaknesses, and how it compares to traditional lock based concurrency. === About the Speaker === Elisabeth is 32 years old, born in Uppsala and raised in Stockholm. She has a PhD in dependent type theory from the University of Bergen, and is currently working as a fullstack developer at Frende Forsikring — a Norwegian insurance company based in Bergen. In her workday, Elisabeth writes primarily in the functional languages F# and Elm. She is passionate about type theory and functional programming, and enjoys sharing her knowledge on these topics with others. === Elisabeths Presentation === drive.google.com/file/d/1zZ-Bu2fl-B9yYrf7VY9iDCGCxyyCCUzr/vi… === Func Prog Conf === funcprogconf.com/ === Sponsor – Multiply === multiply.co/ === Organizers === adabeat.com/ functionalsoftware.se/ Chapters: 00:00 Introduction of Elisabeth Stenholm 00:49 A different way to do concurrency — Haskell’s STM monad 01:54 Let’s look at a simple banking example 06:18 What do we actually want? 08:56 Monad 11:32 Haskell’s STM monad 17:04 We can compose! 21:20 But how does it work? 25:00 No more deadlocks 29:04 STM love Haskell 31:44 Q&A #funcprogconf