Revision as of 18:17, 21 August 2009 edit Pcap (talk \| contribs) Pending changes reviewers, Rollbackers 18,285 edits →Factually disputed: note another solved issue ← Previous edit		Revision as of 02:54, 22 August 2009 edit undo Pcap (talk \| contribs) Pending changes reviewers, Rollbackers 18,285 edits m →Literature survey and conclusion: in print Next edit →
Line 55: == Literature survey and conclusion == This notion is virtually unheard of in print, but it does appear in two ''very recent'' C# books [http://books.google.com/books?q=%22anonymous+recursion%22&btnG=Search+Books], as well as some [[MSDN]] blogs, e.g. [http://blogs.msdn.com/wesdyer/archive/2007/02/02/anonymous-recursion-in-c.aspx]. But note how the author of that blog concludes that he simply rediscovered the Y combinator! So, this is worth no more than a little mention in the [[fixed point combinator]] article. [[User:Pohta ce-am pohtit\|Pcap]] [[User_talk:Pohta ce-am pohtit\|<small>ping</small>]] 18:03, 21 August 2009 (UTC)

Talk:Anonymous recursion: Difference between revisions