3 thoughts on “Y combinator

  1. Coming from an imperative background, I read several explanations of Y-combinators before I understood why they were interesting (same for monads).

    This explanation, found via a thread in classic Lambda the Ultimate, includes a good motivation for why.

  2. What would your “why” be? I always viewed it as a removal of side effects. When the code becomes the data, then you get that interesting meta self referentiality, and you want to abstract the operation of transformations of the code, from the nuts and bolts of it. Perhaps I have not thought deeply enough about it. Thus I would be interested to hear your thoughts.

  3. Yes, the removal of side effects. Plus, the awareness that a recursive function call implies side effects (something you dont get from imperative languages).

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>