The Y Combinator

Jul 20, 2008 19:26


OK, I'm going to try to explain what the Y combinator is, why it's interesting, and how it works. I'll have to include a bit of background information to try to make this post self-contained.

The Y combinator has become a bit of a cool buzzphrase since Paul Graham named his startup incubator company Y Combinator. Why did he choose that name? I ( Read more... )

Leave a comment

Comments 3

Nice explication gcurious July 21 2008, 14:12:22 UTC
It's always amazing how a thing as simple as the Y-combinator can be as hard to explain. Now explain why typing it is so hard :-)

Reply


darius July 21 2008, 18:42:32 UTC
Y can be handy in practice because once your function is in a form like almost-factorial's -- "open recursion" -- you can apply different combinators to it, to add caching or tracing, etc. There was a paper mentioned on LtU about this. Ah, here's another one, not the one I was thinking of, but it does use this idea -- I see you've already seen it: http://lambda-the-ultimate.org/classic/message8479.html

Reply

Y in Practical Programs jamesiry July 26 2008, 00:07:52 UTC
This might be what you were looking for, Darius: http://citeseer.ist.psu.edu/mcadams01practical.html

Reply


Leave a comment

Up