
5 Dec
2007
5 Dec
'07
6:14 a.m.
Roberto Zunino wrote:
Neil Mitchell wrote:
is there any automated way to know when a function is strict in its arguments?
Yes, strictness analysis is a very well studied subject -
...and is undecidable, in general. ;-)
*thinks* Conjecture #1: All nontrivial properties of a computer program are undecidable in general. *thinks more* Conjecture #2: Conjecture #1 is undecidable...