Revision as of 09:22, 28 February 2009 (view source) rosettacode>Paddy3118 (→‎Haskell stateless?) ← Older edit		Revision as of 10:42, 28 February 2009 (view source) rosettacode>Spoon! No edit summary Newer edit →
Line 5: I googled [http://groups.google.co.uk/group/fa.haskell/browse_frm/thread/f0a62b6de1416d8b this]. --[[User:Paddy3118\|Paddy3118]] 09:22, 28 February 2009 (UTC) :It's impossible to write a fixed-point combinator (or perform any recursion, for that matter) in any statically-typed language, without using either recursive functions or recursive types. --[[User:Spoon!\|Spoon!]] 10:42, 28 February 2009 (UTC)

Talk:Y combinator: Difference between revisions

Talk:Y combinator (view source)