Y Combinator is one of the most technical & unintuitive recursion techniques. What does it have to do with programming & how can you benefit? To answer these & other question this talk will walk you through a great mix of slides & live-coding examples. We are going to start with the intuition behind Y, it's history & implementation details. Building a solid foundation, we'll move towards a general idea of a fixed-point combinator, exploring its application in Scala & other languages. In the end we'll see how this knowledge can be helpful in researching advanced techniques such eDSLs, Recursion schemes & others.

Aleksandr is an FP Scala enthusiast at Cake Solutions. Scala is his main language of choice since 2011. He's taken part in various projects, from developing backends for trivial web applications to enterprise-level reactive system & machine learning apps.