> Are you thinking of something else?

I think the point is to contrast them with dynamic arrays --- linked lists, unlike arrays, are persistent data structures, which does make them easier to reason about.

> Also, the common definition of a linked list has the list responsible for allocating each item

I'm not sure how this is relevant in the context of Haskell, given that it's garbage collected.