I have seen papers saying at least Java and Python type systems are turing complete. I wouldn't surprised if all type systems are turing complete
From what I've seen most languages don't want to have a Turing complete type system, but end up with one anyway. It doesn't take much, so it's easy to end up with it accidentally and/or by adding conveniences that don't seem programmable, e.g. associated types and type equality.