You can still do a Y combinator in JavaScript. In http://www.mail-archive.com/[email protected]/msg02716.h... I not only show how to do it, but I show one way that someone reasonably could come up with the construct.

But I agree with you that Y combinators are not generally a good approach for working programmers because there are clearer ways of accomplishing the same thing. However I've heard that in some functional languages they can be very useful as a pattern to compile language constructs to.

I also did something like this. It's fun to port lisp constructs to Javascript.

http://foohack.com/tests/ycomb.html

Does this count as an anonymous recursive function?

a = (function(x) {return x == 0 ? 1 : x * arguments.callee(x - 1)})(8);

Full anonimity, thanks to tilly (separated for better understanding):

  builder   = function(x){ return function(n){ return x(x)(n); }}
  factorial = function(f){ return function(n){ return n==0?1:n*f(f)(n-1);} }
  alert(builder(factorial)(8))

One liner, just seed factorial to builder:

  r = (function(x){ return function(n){ return x(x)(n); } } (function(f){ return function(n){ return n==0?1:n*f(f)(n-1);} }))(8);