11 Sep
2006
11 Sep
'06
3:37 p.m.
Hi Peter,
Any (correct) termination analyzer is, of course, incomplete as the halting problem is undecidable. Our goal is to handle as many "typical/practical/easy" programs as possible.
Can you give any examples of terminating Haskell programs that a human can analyse (perhaps with a bit of thought), but that your system can't? (I couldn't find any in your paper) Thanks Neil