Perhaps you can see it that way. But it's possible to do away also with the local variables, and instead express Y in terms of the two functions
K(a, b) = b S(f, g, x) = f(x, g(x))
But we're quickly drifting off topic now. There are some old messages in the <möte 44: Kombinatorer och lambdakalkyl> conference, if anybody is interested.
/ Niels Möller (igelkottsräddare)
Previous text:
2003-10-07 00:33: Subject: Re: Some tasks from the conference
Well, the difference is that a local variable (by which I really mean a formal argument to a function) can not be defined recursively in terms of itself.
But in your case it is through aliasing. Since x ends up being the function itself after one step in the recursion, the function is in fact defined in terms of itself.
As far as I can tell, all that fancy stuff is just different way of doing naming.
/ Fredrik (Naranek) Hubinette (Real Build Master)