I agree with Tuomas' assessment. We would certainly love to dispense
with
the need for PDL if perl6 offered something along these lines.
But PDL is much more than an efficient memory representation for typed
N-D arrays. Above Jeremy suggests that most of the rest of the PDL core
is already
Tuomas Lukka wrote:
Do we really need PDL objects in perl 6? How about we investigate building
compact arrays into the language? We're already talking about how we can add
typing to the language--I would have thought that if these semantics make it
in, we could look to optimise how
Jeremy Howard wrote:
Make sure you read the interesting RFCs from Damian Conway on related
issues:
* Built-ins: min() and max() functions and acceptors
* Built-ins: reduce() function
Couldn't see these.
* Data structures: Semi-finite (lazy) lists
* Subroutines: higher order
* Built-ins: min() and max() functions and acceptors
* Built-ins: reduce() function
* Subroutines: lazy evaluation of argument lists
* Superpositions: vector operations via superpositions
Couldn't see those either. Could you refer to the actual RFC #s, please?
As I
On Sun, 6 Aug 2000, Jeremy Howard wrote:
* Built-ins: min() and max() functions and acceptors
* Built-ins: reduce() function
* Subroutines: lazy evaluation of argument lists
* Superpositions: vector operations via superpositions
Couldn't see those either. Could
