Content deleted Content added
m →Factually disputed: fix link |
m →Factually disputed: of |
||
Line 48:
This article appears to be the product of somebody with a poor understanding of [[lambda calculus]], where functions are indeed anonymous, in that we don't ''need'' to give them names, you can just write well formed expressions in the calculus. But then this article is nothing more than an application of some fix-point combinator; whether it's Y or not, it doesn't really matter, because [[Fixed_point_combinator#Other_fixed_point_combinators|there's an infinity of fix-point combinators]]. [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 01:42, 21 August 2009 (UTC)
This whole article appears to be a rehashing of the '''Z''' combinator (see link above) which is needed in call-by-value languages, because Y loops forever there (only works in Haskell and other lazy evaluation or call-by-name languages). But this article is so far removed from explaining any of this that it's effectively a pointless mental exercise reading it, and totally redundant alongside [[Fixed point combinator]]. Did I mention this article cites no sources? [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 01:50, 21 August 2009 (UTC)
| |||