[TuringTest]

It's a programming language where every written program terminates.

As a corollary, such languages can't be Turing complete, since universal Turing machines can represent programs which don't terminate.

[1] https://en.wikipedia.org/wiki/Total_functional_programming