3 ms·
You are correct. Total languages are not Turing complete. However, in the case of safety-critical software, we don't actually follow that rule perfectly. We us
by wyager 12y ago
You are correct. Total languages are not Turing complete.
However, in the case of safety-critical software, we don't actually follow that rule perfectly. We usually have one or more main loops that never terminates, but everything called from there does terminate.
In languages that enforce totality, like Agda (which is not suitable for most safety-critical programming), you can either selectively disable termination checking on the main function, or you can recurse over a large number. I'm partial to 99999999999999999.