I may be biased, but to me the verb "to code" means implementing things that require Turing completeness to express.
I may be biased, but to me the verb "to code" means implementing things that require Turing completeness to express.
These non-turing-complete languages can be used for some useful things, besides the compiler's proof that they terminate. The main use is getting totality (knowledge that for all valid inputs, you will get a valid output) and then writing programs that generate proofs. The fact a valid, total program that generates the proof exists, means that the proof exists, and we don't have to run the program! Thus, in this terminating-language context, a valid program that generates a proof, is itself a proof.
This is very useful for compiler-verified proofs of correctness about various aspects of your program.
tl;dr: Turing Completeness is taken for granted, but for many kinds of programming, it appears it may be useful to have less.
See also: Agda, Epigram, Coq.