Could the fold approach have worked? If so, how?
intersperse' i = foldr (\x ys -> x : if null ys then [] else i : ys) []
In the fold, we cannot access the rest of the input, only the rest of the output. However, if and only if the input was empty, the output will be empty. So null ys
happens to works here.
Interesting aspects:
I changed the argument order to match the standard
intersperse
. This happens to work better with the foldr-based definition. More importantely, I feel thatintersperse
is more often partially applied with an element than with a list, so the element should go first.I use
foldr
instead offoldl
to increase laziness and avoid the accumulator construction.I make sure that
intersperse'
produces the first(:)
cell before thenull
check.