Quickly memoize anonymous recursive functions using lambdas and the "fix function"...

Generating powerset in one function, no explicit recursion, and using only simplest primitives in Ra...

Which programming languages support functions that take themselves as arguments?...

Two-layer "Y-style" combinator. Is this common? Does this have an official name?...

Little Schemer: write function that only supports lists of length ≤ 2...

The mechanism of anonymous function to call itself in Scheme?...

How to do this length≤1 more than once?...

Little Schemer: why wrap (mk-length mk-length) into a function?...

How to create a big array of Func's representing a Vandermonde system in C#?...

C# anonymous recursion and Y-combinator performance...

Recursion function failed in CodeIgniter...

Y combinator, Infinite types and Anonymous recursion in Haskell...

Recursion with anonymous function...

Howto: "letrec" in C# (lambda expression call within its definition)...

Does "Anonymous Recursion" work in .NET? It does in Mono...