Turing completeness is a bug, not a feature. After writing code in Agda for some years I was convinced that Turing completeness does more harm than good. Non-TC languages have a killer feature: their halting problem is solvable which means you can get arbitrarily strong guarantees from the compiler. The fact that you can't encode "while(true) { }" without putting "unsafe" doesn't make the language impractical, you can still implement algorithms without Turing completeness.

Moreover, using various forms of coinduction you can encode infinite computation even in non-TC languages.

Many perfectly reasonable subturing PLs exist. For example Gallina, the total functional language at the heart of Coq.

Turing completeness is not a requirement of a programming language! Just because you can't do infinite computation doesn't mean you can't do infinitely useful computation :)

That said, Souffle is touring complete due to its adding of constructors to the language.