iiuc, the dichotomy "programming language vs. type system" doesn't hold for type-theoretic programming. E.g., languages based on System F (like Haskell) are based on a programming language that is inherently typed.
To take a much simpler example, the Simply Typed Lambda Calculus precludes non-terminating programs, but is not generally useful.