Joost Diepenmaat wrote:
> "David Formosa (aka ? the Platypus)" <dformosa@[EMAIL PROTECTED]
> writes:
>
>
>>On Sun, 10 Feb 2008 10:26:42 +0000, Jon Harrop <usenet@[EMAIL PROTECTED]
>
>>wrote:
>>
>>>Actually, I can't think of any other languages that sup****t recursive
>>>anonymous functions anyway: none of Lisp, Scheme, SML, OCaml, F# and
>>>Haskell do AFAIK.
>>
>>You can do anonymous recusion in Lisp and Scheme via letrec. Any
>>language where you can implement the Y-combinator you can get
>>anonymous recursion.
>
>
> FTR:
>
> One language I know that directly sup****ts anonymous recursion (without
> Y-combinator) is JavaScript:
>
> var fib = function(i) {
> if (i == 0 || i == 1) return 1;
> return (arguments.callee.call(null,i-1) +
arguments.callee.call(null,i-2));
> };
>
Maybe I should do Cells/JS. Flapjax does FRP, but really badly, with
"lifting".
The subtext here is that a ****t of my Algebra software to JS let's me
distribute via the Web /and/ push the ****p date past my shuffle-off
date. Sweet!
kenny
--
http://smuglispweeny.blogspot.com/
http://www.theoryyalgebra.com/
"In the morning, hear the Way;
in the evening, die content!"
-- Con****ius
|
