News for hackers. Stuff that matters.
Re:Parallelism is not concurrency by akjj on Tuesday March 22, 2011 @01:38PM (#2355405)
I found the article he links to at the end to be a more transparent explanation:

http://ghcmutterings.wordpress.com/2009/10/06/parallelism-co...

Re:Parallelism is not concurrency by vilhelm_s on Tuesday March 22, 2011 @03:52PM (#2356128)
But Bob Harper really makes two points, and Simon Marlow's article only covers one of them. The fist point is that parallel functional languages makes it possible to write correct parallel programs easily, by not exposing any nondeterminism to the programmer. The second point is that for such a language it's particularly easy to describe what the running time of the program will be, by talking about the depth and work of a computation.

Of course, the reason Marlow doesn't make that point is that it's not true for Haskell! In ML, the work involved in computing f(g(1)) is the work of computing g plus the work of computing f. But in Haskell that's not true, since if f doesn't use it's argument, g will never run.

Re:Parallelism is not concurrency by barrkel on Tuesday March 22, 2011 @02:33PM (#2355741)
Yes, that's a better article than this one.