YALF (yet another lint foulup)

[Doug Gwyn]

In article <9341 at ihlpb.ATT.COM> nevin1 at ihlpb.UUCP (55528-Liber,N.J.) writes:
>Never returning is a hard property to check in C.

In fact it's impossible in general, because that would imply the
existence of a perfect decision procedure.  For example, suppose
that a proof-searching function returns if and only if it finds a
proof of Fermat's last theorem.  We don't know whether or not it
will "ever" return.  (Actually, since there are finite resources
in the run-time environment, if the algorithm cannot get into an
infinite loop then it must terminate eventually, but it may well
take longer than the age of the universe to do so.)