The halting problem, basically. It's possible for something constructed in the type system (not the program that's being typed, like a type declaration) to recurse infinitely and never stop running until terminated.

That said, there's some contention in that thread over whether or not Turing completeness has been demonstrated.