Comments on Paul Batum: Refactoring Towards the Y Combinator: Part 6

// One-argument Y-Combinator Y fixed-point combin...

2011-05-25T23:49:40.770+10:00

// One-argument Y-Combinator Y fixed-point combinator.
public static Func Y(Func, Func> f)
{
return
t => // A function that...
f( // Calls the factorial creator, passing in...
Y(f) // The result of this same Y-combinator function call...
// (Here is where the recursion is introduced.)
)
(t); // And passes the argument into the work function.
}

[TestMethod]
public void TestMethodY()
{
Func fib = Y(f => n => n > 1 ? f(n - 1) + f(n - 2) : n);
Func fact = Y(f => n => n > 1 ? n*f(n - 1) : 1);
Console.WriteLine(fib(6)); // displays 8
Console.WriteLine(fact(6)); // displays 720
}

2010-10-10T01:59:53.401+11:00

This comment has been removed by a blog administrator.

2010-10-10T01:58:58.819+11:00

This comment has been removed by a blog administrator.

Very good writing! I actually got it this time. No...

2010-04-26T05:24:06.222+10:00

Very good writing! I actually got it this time.
No constructive critisism this time, sorry :)

2010-03-05T07:08:13.296+11:00

This comment has been removed by a blog administrator.

This is a great series, and very nicely explained....

2009-06-02T22:14:44.565+10:00

This is a great series, and very nicely explained.

Really glad to hear it fairweather. Thanks for the...

2009-05-24T22:47:31.093+10:00

Really glad to hear it fairweather. Thanks for the comment!

Thank you for this series, it's really enjoyable -...

2009-05-24T04:10:04.184+10:00

Thank you for this series, it's really enjoyable
-fairweather