Re:I want to fix programming
by dullcrisp on Tuesday January 24, 2012 @04:58PM
(#3507078)
He doesn't have to specify whether or not the sort is stable -- the compiler should only have to satisfy the constraints he imposes. So if he doesn't specify that it must be a stable sort, the sort might be unstable, just as with many sort routines that don't specify whether they're stable.
[ Parent
| on HN ]
This is what I mean by hidden / unstated assumptions. So on one version / implementation of the compiler, a program may produce correct output, where on another, it produces incorrect output, because of a hidden assumption about the stability of the produced sort. The problem may not be found in testing due to this; and what will debugging the program look like?
If this is the kind of issue that can come up in a really simple task, what kind of issues will emerge as things scale up?