> SAC has syntactic forms to define arrays that are somewhat reminiscent of
> array comprehensions, although they are much more restricted. An interesting
> route for a *real* array-optimizing Haskell compiler could be to try to find
> instances of array comprehensions that can be mapped to constru
| You could check out SAC. SAC is a functional language specialized for
| arrays, with restrictions in the language to ensure efficient
compilation.
| The SAC compiler can apparently do a very good job on
scheduling/memory
| allocation as to optimize for cache performance: this is an important
iss
Matthew Donadio:
>| Many spectral estimation routines are defined in terms of special
>| matrices (ie, Toeplitz, etc). Arrays defined recursively by list
>| comprehensions make it easy to implement algorithms like
>Levinson-Durbin
>| recursion, and they look very similar to the mathematical defini
Matthew
| Many spectral estimation routines are defined in terms of special
| matrices (ie, Toeplitz, etc). Arrays defined recursively by list
| comprehensions make it easy to implement algorithms like
Levinson-Durbin
| recursion, and they look very similar to the mathematical definitions:
|
| >
Matthew Donadio <[EMAIL PROTECTED]> writes:
> OK, my question then has to do with the efficiency of lists versus
> arrays. Do the latest compilers handle handle arrays efficiently, or
> are lists really the way to go?
I've currently struggled a bit with arrays. I have a list based
program (ca
Hi all,
I'm sorry if this topic has been rehashed a lot, but I poked around in
the mailing list archive, and didn't find what I was looking for.
I currently have some free time on my hands, and have been implementing
some digital signal processing and spectral/frequency estimation
algorithms alon
