[Haskell-cafe] Why is this strict in its arguments?

Andrew Coppin andrewcoppin at btinternet.com
Wed Dec 5 06:14:05 EST 2007

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. ;-)


Conjecture #1: All nontrivial properties of a computer program are 
undecidable in general.

*thinks more*

Conjecture #2: Conjecture #1 is undecidable...

More information about the Haskell-Cafe mailing list