News for hackers. Stuff that matters.
Re:Why Lisp is a Big Hack (And Haskell is Doomed to Succeed) by jaekwon on Monday January 03, 2011 @05:46AM (#2062776)
For any given Haskell Compiler I would think that I can construct a program where the Haskell Compiler won't be able to determine, in polynomial time, whether the list has length 0 or not.
Re:Why Lisp is a Big Hack (And Haskell is Doomed to Succeed) by eru on Monday January 03, 2011 @06:00AM (#2062792)
Have you read the post your are commenting on? Epigram does not even try to be a complete language.
Re:Why Lisp is a Big Hack (And Haskell is Doomed to Succeed) by jbapple on Monday January 03, 2011 @07:38AM (#2062934)
> For any given Haskell Compiler I would think that I can construct a program where the Haskell Compiler won't be able to determine, in polynomial time, whether the list has length 0 or not.

Ok, sure, but in total languages (that is, languages in which all functions are total), compilers generally don't just continue running if they can't figure out that some list you've applied "head" to is non-empty. They generally exit with a type error, complaining that you haven't proven that your list is non-empty.