<p>According to the Haskell wiki, the <code>scanl1</code> function is partial. I don't understand what inputs result in bottom, though. For list functions, I'm used to the problem inputs either being empty lists (like for <code>head</code>) or infinite ones (like for <code>reverse</code>). However, <code>scanl1</code> seems to handle both of these types of lists correctly. Is this actually a partial function? If so, what's an example of an input that will result in bottom?</p>

<p>That's a mistake on the wiki. <code>scanl1</code> is in fact total. (I've updated the wiki.)</p>

Is scanl1 really partial?

Tags:

According to the Haskell wiki, the scanl1 function is partial. I don't understand what inputs result in bottom, though. For list functions, I'm used to the problem inputs either being empty lists (like for head) or infinite ones (like for reverse). However, scanl1 seems to handle both of these types of lists correctly. Is this actually a partial function? If so, what's an example of an input that will result in bottom?