Lazy functors and friends

[Henning Thielemann]

I have written a Wiki article where I argue, that Functor instances
should match their arguments strictly in order to comply with the laws.
However for the Traversable class I did not find laws, thus I invented
one myself:

sequenceA (fmap Identity x)  ==  Identity x

What do you think of it? Are there more laws that would be reasonable?

http://www.haskell.org/haskellwiki/Lazy_functors