Haskell has a static type system. "Strictness" in PL theory usually refers to an eager evaluation strategy.
But yes, you are correct. The comment you replied to does not make sense. Haskell is not dynamically typed at all. (Though as with any statically typed language, you can create a Grand Unified Type that stores everything and pretend it's dynamic.)