[Haskell-beginners] ACID-state - how does it evaluate data

Dear Haskell-Beginners I have a problem understanding how ACID-state stores its data. To be more specific, I would like to know how does it deal with lazy evaluation. I suppose it tries to "strictly" evaluate functions before serializing, but then how does it handle infinitely-recursive structures? Regards, kombat