> Haskell has infinite and recursive constructs, lazily computed. That’s what makes their type system undecidable. Haskell (98) has infinite and recursive cons

> Haskell has infinite and recursive constructs, lazily computed. That’s what makes their type system undecidable. Haskell (98) has infinite and recursive constructs and its type system is not undecidable.