News for hackers. Stuff that matters.
Re:When is a recursive function not a recursive function? by kazinator on Sunday October 05, 2014 @11:03AM (#8412438)
This is a non-issue if those languages are also pure, so that the name binding cannot be redefined.

Part of the reason why the function is called "first class" is that it has a captured environment. And that name binding which it is using to refer to itself is just an element of that environment: in other words, it comes from the function itself.

If you have some built in means for self-reference, like some special (self) expression or special symbol or something, that is possibly going to be implemented as some hidden symbol in the function's environment anyway, or a hidden parameter.

There are no comments on this comment yet.