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...
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
