Anonymous user
Talk:Y combinator: Difference between revisions
→Is this really the "Y" combinator?
(Slate entry incomplete?) |
|||
Line 41:
:Hmm, They are related, and my reference, (and others), seem to have lumped them both together under the familiar title "Y combinator". I suggest a redirect of "Z combinator" to this page and a note be added to task. --[[User:Paddy3118|Paddy3118]] 05:48, 2 March 2009 (UTC)
A quick glance over the different implementations shows that most of them define the Z combinator. But that is the closest you can get in applicative-order languages. The Z combinator is just one eta-conversion away from the Y combinator. So in lambda calculus these are basically the same: "two functions are the same if and only if they give the same result for all arguments". [[Special:Contributions/131.155.116.18|131.155.116.18]] 17:28, 30 November 2009 (UTC)
==Could We remove the recursive examples!==
| |||