I began to understand lambda-calculus with this introduction from Raoul Rojas. But I was lost when he explains recursion via the Y-combinator. In fact I think t

I began to understand lambda-calculus with this introduction from Raoul Rojas. But I was lost when he explains recursion via the Y-combinator. In fact I think that recursion is best understood when lambdas are introduced to bring a bit of lazyness in an by default eager evaluation. The (if bool one two) control structure is not so easy to understand under the cap.