On 3 December 2012 15:59, Raul Miller <rauldmil...@gmail.com> wrote:
> Also, there isn't anything you can do with lambda notation that you
> cannot do in J. J's gerunds have all the expressiveness of lambdas,
> and you can implement anything in them up to and including call/cc.
>
Raul, you know your stuff and I always enjoy your posts, even if I don't
necessarily agree that it's as "easy" as you make it sound!...
For instance, I suspected that what you state about gerunds was the case,
but I have really resisted getting into them big time. It's still at a
hobby level for me, so no rush. Good to know.
Your description of gerunds does make it sound a bit like J would be too
slow for symbolic processing though, which I am sure is not true.
> And, for that matter, J is something of a dual of Scheme.
Interesting and cool viewpoint.
> Anyways, it's great that arrays are starting to appear in other
> languages. I can hope that within the next years languages like
> python will have the array expressiveness that APL had back in the
> 60s.
My main concern would be that other languages will rush to exploit
CUDA/OpenCL as soon as they have adequate array implementations. Here's
(+/ .*)~ ? 10 10 $ 300 in Mathematica, from their current blurb.
CUDADot [RandomInteger[300,{10,10}],RandomInteger[300,{10,10}] ]
They are learning fast.
I haven't tested it, don't have Mathematica, but I don't think the
execution will be slow.
Something to pore on.
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
