Calculating time space complexity in lazily evaluated languages

Can anyone tell me how does one go about calculating the time space complexity of lazily ev开发者_JAVA百科aluated languages?. I heard its difficult, but I would like to give it a try.

Thanks in advance

At least for the case of data structures (I dare wager that generalises to vanilla code), you will find information in Okasaki's "Purely functional data structures. Other papers from him might be valuable to your undertaking, too.