Matthew Donadio wrote:
> First, I cannot get a function to type. The basic definition is:
>
> rxx x k | k >= 0 = sum [ (conjugate (x!k)) * x!(n+k) | k <- [0..(n-1-k)]
> ] / n
> | k < 0 = conjugate (rxx x (-k))
> where n = snd (bounds x) + 1
>
> This function performs autocorrelati
Hi all,
I hope everyone had a nice holiday season.
I am picking up a project that I started a few years ago, but for
various reasons stopped working on. It was the Libraries for Digital
Signal Processing listed in the Numerical Algorithms and Mathematics
section on the haskell.org website. I am
Vinicius Callegari writes:
[...]
> Tim, watch out, your date is in the past. You messages might not be read...
Thanks for the warning. The messages were indeed sent in the past, and took an
unusually long time to be delivered!
Apparently a few messages got queued somewhere by my MTA (perhaps be
Michael Hobbs writes:
> Just took a look at the results for the ICFP contest. Am I correct in
> assuming that "LA" stands for Lennart Augustsson and that "Si^3" stands
> for Simon Marlow, Simon Peyton-Jones, Sigbjorn Finne?
Is there a URL for the results ?
Tim
_
S.D.Mechveliani writes:
> As Haskell has the standard functions fst, snd to decompose (a,b),
> maybe, it worths to provide also
> tuple31, tuple31, tuple31,
> ...
> tuple51, tuple52, tuple53, tuple54, tuple55
>
G'day all.
On Thu, Jan 02, 2003 at 08:39:18AM +, Alastair Reid wrote:
> Please note that this is NOT TRUE!
Whoops, you're right. Sorry, my mistake.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/l
> 1. Haskell 98 does not explicitly mandate tail recursion optimisation.
However, in practice Haskell compilers must provide this since it is
impossible to write a loop without using recursion and if your loops
don't use constant stack space, you're not going to run for very long.
> (In particul
