Hello minh,
Monday, May 8, 2006, 12:28:35 PM, you wrote:
> acc1 ints = foldr (+) 0 ints
foldl?
> --
> acc2 ints = execState (mapM add2 ints) 0
> add2 :: Int -> State Int ()
> add2 i = do
> acc <- get
> put (acc + i)
This is to announce a new Haskell application: lambdaFeed is an RSS 2.0
feed generator. It reads news items - in a non-XML, human-friendly
format - distributed over multiple channels and renders them into the
RSS 2.0 XML format understood by most news aggregators as well as into
HTML for inclusion
Has anyone got any examples of these working together?
Thanks, Dominic.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
I run into the problem with test1 all the time: It's accumulating
partially evaluated expressions like this:
1+1+1+1+1+1+...
and filling up memory. Try foldl' instead, and look here:
http://en.wikibooks.org/wiki/Programming:Haskell_List_Processing
Also have a look at this past discussion:
ht
Hi all,
the problem is simple but i can't do it :
I want to generate some values and 'accumulate' them. The meaning of
'accumulating' is not so important. The only point is that to
'accumulate' the values, I only have to know one value and the
accumulator (and not all the values).
The most simp
