Or: Approaching the Y Combinator These are some of my class notes. Learning to derive the Y Combinator from first principles is something I’ve always wanted to do. This isn’t quite the Y Combinator, but it’s very close and it still gets you recursion without relying on recursive structures to begin with. In the beginning, we write a recursive function to compute the length of a list: (let*([len (λ(lst)(if(null? lst)0(+1(len (cdr lst)))))])(len '(123))) The let* syntax allows us to crea...
