this is actually a domain theoretic phenomenon, not a laziness one! As a rule of thumb, what distinguishes the calculation of a final coalgebra from that of an initial algebra is that the former is computed as a limit while the latter is computed as a colimit.
However, in many categories enriched over domains, such limits/colimits are the same! I've looked for a more gentle introduction to the topic and wasn't able to find it. A more technical presentation can be found ihe original Smyth and Plotkin paper "the category-theoretic solution of recursive domain equations" or the domain theory notes by Abramsky and Jung