generalized fold (and other newbie question)

[Johannes Waldmann]

Thanks for the answers.

> The problem with that algorithm is that, 
> without delayed arrays (as in Repa), it's space requirements are n^3 for nxn matrices.

yes, I was assuming that the 3-dim arrays are "virtual"
(you don't store the array elements but just the index computation).

> We just wrote a paper about Accelerate. 

OK, will study.

Thanks, Johannes.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 260 bytes
Desc: OpenPGP digital signature
Url : http://projects.haskell.org/pipermail/accelerate/attachments/20101014/1cf1c572/attachment.pgp