Hi, all.

Can it be possible to do fold with short circuit and accumulator both?
For example, can we find an element which is same value to adjacent one?

findAdjacent [1,2..n, n, n+1, n+2.......] => n
                         \__very long__/

Though there can be many ways to do it, Can we do it with fold[r|l]?

I'll be happy to receive any comments.

Chul-Woong
_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners