On Wed, 2004-04-21 at 15:46, Larry Wall wrote:
> On Wed, Apr 21, 2004 at 03:15:37PM -0400, Dan Sugalski wrote:
> : The math folks tell me it makes sense. I can come up with a
> : half-dozen non-contrived examples, and will if I have to. :-P
>
> I've said this before, and I'll keep repeating it till it sinks in.
> The math folks are completely, totally, blazingly untrustworthy on
> this subject. [...] They can't have my »« without a fight.
Ah... now you see the true face of the age-old Linguistics-Mathematics
wars! ;-)
But seriously, to summarize what I've learned from this thread:
* "my int @foo" will compile down into an efficient representation
* PDL (and its like) will be able to use this to efficiently
perform high-level operations on arrays, but only built-in
operations
* If someone (e.g. PDL) wants to implement other operations and
their hyper-equivalent, they can do it in a high level language
like P6 or as run-time loadable parrot opcodes (which PDL will
certainly have to do, since most of their ops are in an ancient
and gigantic Fortran lib).
Sounding like problem solved to me! Thanks Larry.
--
Aaron Sherman <[EMAIL PROTECTED]>
Senior Systems Engineer and Toolsmith
"It's the sound of a satellite saying, 'get me down!'" -Shriekback
