<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Multicore Haskell Now!  ACM Reflections &#124; Projections 2009</title>
	<atom:link href="http://donsbot.wordpress.com/2009/10/17/multicore-haskell-now-acm-reflections-projections-2009/feed/" rel="self" type="application/rss+xml" />
	<link>http://donsbot.wordpress.com/2009/10/17/multicore-haskell-now-acm-reflections-projections-2009/</link>
	<description>A Journal of Haskell Programming</description>
	<lastBuildDate>Mon, 03 Oct 2011 02:09:43 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Martin Sulzmann</title>
		<link>http://donsbot.wordpress.com/2009/10/17/multicore-haskell-now-acm-reflections-projections-2009/#comment-251</link>
		<dc:creator><![CDATA[Martin Sulzmann]]></dc:creator>
		<pubDate>Mon, 19 Oct 2009 19:07:01 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=417#comment-251</guid>
		<description><![CDATA[Nice! Great summary of what you can do with concurrent/parallel Haskell.

One technical comment: You say somewhere &quot;STM can&#039;t deadlock&quot;. I guess you mean if there&#039;s no retry.
With retry you can simulate a mutex, eg see 
&quot;Comparing the performance of concurrent linked-list implementations in Haskell&quot;, and then you can run into a deadlock.]]></description>
		<content:encoded><![CDATA[<p>Nice! Great summary of what you can do with concurrent/parallel Haskell.</p>
<p>One technical comment: You say somewhere &#8220;STM can&#8217;t deadlock&#8221;. I guess you mean if there&#8217;s no retry.<br />
With retry you can simulate a mutex, eg see<br />
&#8220;Comparing the performance of concurrent linked-list implementations in Haskell&#8221;, and then you can run into a deadlock.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Manuel Chakravarty</title>
		<link>http://donsbot.wordpress.com/2009/10/17/multicore-haskell-now-acm-reflections-projections-2009/#comment-249</link>
		<dc:creator><![CDATA[Manuel Chakravarty]]></dc:creator>
		<pubDate>Sun, 18 Oct 2009 06:07:05 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=417#comment-249</guid>
		<description><![CDATA[It just occurred to me that a nice aspect about the new Haskell logo is that it is easy to associate it with parallelism.]]></description>
		<content:encoded><![CDATA[<p>It just occurred to me that a nice aspect about the new Haskell logo is that it is easy to associate it with parallelism.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
