On Sun, Jun 14, 2009 at 8:18 PM, Eugene Kirpichov <ekirpic...@gmail.com>wrote:
> The idea looks cool, but perfect strictness analysis is not possible, > t.i. the problem of determining whether f _|_ = _|_ is undecidable, > since it is a non-trivial property of f (there exist f's for which it > is true, and ones for which it is false) and non-trivial properties > are undecidable, thanks to Rice theorem. Unless you remove _|_ from the language. If you have a "total" functional programming language[1] it becomes a trivial property, right? I guess this would also extend to some dependently typed languages too. [1] http://lambda-the-ultimate.org/node/2003 Jason
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
