[intortus]

There are mainstream languages with decidable static type systems. They compile quickly and give obvious short error messages.

[jcelerier]

names ! we want names !

also, decidable likely implies total - and my experience with total languages is that more often than not you need to add another turing-complete "scripting" layer on top of it (for instance, a TC language to generate expressions in the total language) as it's so cumbersome to write otherwise when you have actually business rules and not simple math examples