Revision as of 07:22, 21 August 2009 edit Pcap (talk \| contribs) Pending changes reviewers, Rollbackers 18,285 edits →"Fixed point combinators allow the definition of anonymous recursive functions": done ← Previous edit		Revision as of 21:33, 21 August 2009 edit undo Pcap (talk \| contribs) Pending changes reviewers, Rollbackers 18,285 edits →Why is the Haskell Y the Y combinator?: update Next edit →
Line 112: Technically the Haskell definition is the equation that defines ''any'' fixed point combinator no? So why is it Y? [[User:Pohta ce-am pohtit\|Pcap]] [[User_talk:Pohta ce-am pohtit\|<small>ping</small>]] 04:51, 21 August 2009 (UTC) : Well, that was incorrect, so I've [http://en.wikipedia.org/w/index.php?title=Fixed_point_combinator&diff=309319192&oldid=309312639 fixed it]. [[User:Pohta ce-am pohtit\|Pcap]] [[User_talk:Pohta ce-am pohtit\|<small>ping</small>]] 21:33, 21 August 2009 (UTC) == "Fixed point combinators allow the definition of anonymous recursive functions" ==

Talk:Fixed-point combinator: Difference between revisions