I was trying to figure out how Haskell was evaluating a recursive function on lists and a great way to visualize was to use finite state machines.

A very basic one at best, but it really made the recursion a lot clearer.