Algorithm design with the Selection Monad | Johannes Hartmann | Research Student and Software Engineer ABSTRACT Ever wondered what the selection monad is and how it can be useful to programmers? In my talk, I want to provide a basic intuition on how the selection monad can be used and how we can utilise it to implement different kinds of algorithms. We will see that exhaustive search and greedy algorithms work quite well together with the selection monad. Paper authors: Johannes Hartmann and Jeremy Gibbons • Follow us on social: Twitter: https://twitter.com/LambdaDays LinkedIn: https://www.linkedin.com/company/lambda-days/ • Looking for a unique learning experience? Attend the next Code Sync conference near you! See what’s coming up at: https://codesync.global • SUBSCRIBE TO OUR CHANNEL https://www.youtube.com/channel/UC47eUBNO8KBH_V8AfowOWOw