[Haskell-beginners] FoldL/R Reducing List

[Waaaggh]

i am trying to implement remowal of repetting elements from lists with foldeg.
[1,1,1,2] -> [1,2]
[1,1,2,2,3,1,1,1] -> [1,2,3,1]


2009/6/22 Daniel Fischer <daniel.is.fischer at web.de>

> Am Montag 22 Juni 2009 13:10:08 schrieb Waaaggh:
> > Hi.how can i reduce list with foldl.r ?
> >
> > np (1,1,1,2,3,3,4,5,5) -> (1,2,3,4,5) ???
> > Azz.
>
> First, these are tuples, not lists.
> Second, what are you trying to do?
> Implement nub via fold(l)r?
> Is http://www.haskell.org/haskellwiki/Homework_help relevant to your
> request?
> _______________________________________________
> Beginners mailing list
> Beginners at haskell.org
> http://www.haskell.org/mailman/listinfo/beginners
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/beginners/attachments/20090622/15c8a123/attachment.html