Tim Sweeney talks about Haskell

Robert Dockins robdockins at fastmail.fm
Fri Feb 3 13:30:48 EST 2006


Somewhat apropos.  The following recent post on LtU links to some  
slides by Tim Sweeney (Epic Games) wherein he discusses things he  
does and doesn't like about Haskell.

Notable points:

   == Positive on ST (implies need for rank 2 types)
   == Positive on Concurrency and STM
   == Positive on list comprehension (but would like to see array  
comprehension)
   == Positive on declarative initialization
   == Wants static type guarantees about integer overflow, array bounds
   == Wants a good, safe way to do dynamic casts
   == Not happy with runtime cost of lazy evaluation, suggests  
lenient evaluation
   == Claims "purely functional is the right default"!
   == Doesn't like the syntax
   == Claims there are problems with programming in the large (see  
last slide)


Anyway, some further fuel for the fire.

http://lambda-the-ultimate.org/node/1277


There is a link to PDF of the slides a couple of posts down...



Rob Dockins

Speak softly and drive a Sherman tank.
Laugh hard; it's a long way to the bank.
           -- TMBG





More information about the Haskell-prime mailing list