Re:Programming Languages Going Above and Beyond
by redjamjar on Thursday June 29, 2023 @05:06PM
(#36526695)
> there are a huge number of useful loops that do useful work and for which you can prove properties like termination
Exactly! If the loop doesn't terminate, then you obviously cannot show it. But if it does, then you should be able to (even if that requires some changes to help the tool)
Re:Programming Languages Going Above and Beyond
by jjnoakes on Thursday June 29, 2023 @06:26PM
(#36527681)
> If the loop doesn't terminate, then you obviously cannot show it.
I don't think this is true for all loops either - some can be proven to never terminate, just like some can be proven to terminate. And some can't be proven either way.
I think the point is that even though one can't determine loop termination for all loops (easily provable), there are a huge number of useful loops that do useful work and for which you can prove properties like termination (and other static properties).