Again, that depends on binding the function to the name. If that binding changes (as in the example given where some logging is added), things break. Also, bein

Again, that depends on binding the function to the name. If that binding changes (as in the example given where some logging is added), things break. Also, being able to do with completely anonymously allows you to use a recursive lambda anywhere you can use a lambda or a block, something that is not currently possible without making a combinator. There’s a practical example of using the Y-COmbinator to make auto-vivifying hash tables in one of the links.