Rene de Visser <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.haskell.general:
> To do this I need to cast my 5 dimensional array to a 1 dimensional
> array? Does this work? i.e. how do I know that GHC uses a flat array
> representation for multidemsional arrays (rath
Haskell Weekly News: November 1, 2005
Greetings, and thanks for reading the 13th issue of HWN, a weekly
newsletter for the Haskell community. Each Tuesday, new editions will be
posted (as text) to [1]the Haskell mailing list and (as HTML) to [2]The
Haskell Sequence
Gregory Woodhouse <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.haskell.general:
> Okay, this seems sensible enough. Loosely speaking, I see this code
> as getting a line, checking to see if it's empty. If it is, it just
> quits (returning the "empty" value). Othe
I was wondering... In my experience, it's worked much better to use
sum' = foldl' (+) 0
than the built-in "sum" function, which leaks memory like crazy for
large input lists. I'm guessing the built-in definition is
sum = foldr (+) 0
But as far as I know, (+) is always strict, so foldl' seems mu
I'm pleased to announce the first release of Frown (version 0.6,
andromeda release), an LALR(k) Parser Generator for Haskell 98.
This is a beta quality release.
Frown's salient features are:
o The generated parsers are time and space efficient. On the downside,
the parsers are quite large.
o
On 11/1/05, Scherrer, Chad <[EMAIL PROTECTED]> wrote:
> I was wondering... In my experience, it's worked much better to use
>
> sum' = foldl' (+) 0
>
> than the built-in "sum" function, which leaks memory like crazy for
> large input lists. I'm guessing the built-in definition is
>
> sum = foldr (+
On 01/11/05, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
> On 11/1/05, Scherrer, Chad <[EMAIL PROTECTED]> wrote:
> > I was wondering... In my experience, it's worked much better to use
> >
> > sum' = foldl' (+) 0
> >
> > than the built-in "sum" function, which leaks memory like crazy for
> > large
On 01/11/05, Scherrer, Chad <[EMAIL PROTECTED]> wrote:
> I was wondering... In my experience, it's worked much better to use
>
> sum' = foldl' (+) 0
>
> than the built-in "sum" function, which leaks memory like crazy for
> large input lists. I'm guessing the built-in definition is
>
> sum = foldr (
Cale Gibbard wrote:
On 01/11/05, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
On 11/1/05, Scherrer, Chad <[EMAIL PROTECTED]> wrote:
I was wondering... In my experience, it's worked much better to use
sum' = foldl' (+) 0
than the built-in "sum" function, which leaks memory like crazy for
larg
>
> You don't always want (+) to be strict. Consider working with
> the ring of formal power series over, say, the integers. You
> don't want (+) to force the evaluation of an infinite formal
> summation which is passed to it, since that's an infinite
> loop, so it will have to be non-strict,
On 01/11/05, Lennart Augustsson <[EMAIL PROTECTED]> wrote:
> Cale Gibbard wrote:
> > On 01/11/05, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
> >
> >>On 11/1/05, Scherrer, Chad <[EMAIL PROTECTED]> wrote:
> >>
> >>>I was wondering... In my experience, it's worked much better to use
> >>>
> >>>sum' =
The solution would be to bring 'sum' and 'product' into the Num class so
the most efficient version for each type can be used and the default is
no worse than the current non-class versions. (this is even pretty much
completly backwards compatable so could be considered for haskell 06)
I'd also li
On 01/11/05, John Meacham <[EMAIL PROTECTED]> wrote:
> The solution would be to bring 'sum' and 'product' into the Num class so
> the most efficient version for each type can be used and the default is
> no worse than the current non-class versions. (this is even pretty much
> completly backwards c
> The solution would be to bring 'sum' and 'product' into the Num class so
> the most efficient version for each type can be used and the default is
> no worse than the current non-class versions. (this is even pretty much
> completly backwards compatable so could be considered for haskell 06)
>
>
14 matches
Mail list logo
