[CSE Seminar] Making recursion simple, by making recursion simple

This is a talk by John Azariah (Microsoft). It was a part of the CSE Department Seminar Series at IIT Gandhinagar. --- Abstract. The Y (and Z) combinators are theoretical constructs that allow us to express recursion from first principles. In this talk, which requires no foundation in mathematics or theory, I'll write code and evolve these combinators in F#, and show how powerful they are. You should get a deeper appreciation for the power of functional programming and some of the benefits of applying theoretical foundations... Bio. John has over 30 years of experience writing all kinds of software, and was one of the original designers of the Microsoft Q# language for Quantum Computing. He is a frequent speaker at conferences on various topics of expertise including on functional programming, cloud computing, quantum computing and software engineering. He currently works on the AKS team at Microsoft and is based in Brisbane, Australia with his wife and daughter.