<?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"
	>
<channel>
	<title>Comments on: What is Haskell&#8217;s primary feature?</title>
	<atom:link href="http://blog.tmorris.net/what-is-haskells-primary-feature/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.tmorris.net/what-is-haskells-primary-feature/</link>
	<description>The weblog of Tony Morris</description>
	<pubDate>Sat, 04 Feb 2012 12:56:44 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: Thomas Wood</title>
		<link>http://blog.tmorris.net/what-is-haskells-primary-feature/#comment-36500</link>
		<dc:creator>Thomas Wood</dc:creator>
		<pubDate>Fri, 22 Jan 2010 13:53:23 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tmorris.net/?p=636#comment-36500</guid>
		<description>Some aspects of this quite frankly shocked me, when shown by a PhD student in a lecture, I'm still having trouble figuring out exactly how it managed to work!

I still love the simplicity of the Fibonacci number generator that relies on this principle:
&lt;code&gt;fibs = 0 : 1 : zipWith (+) fibs (tail fibs)&lt;/code&gt;</description>
		<content:encoded><![CDATA[<p>Some aspects of this quite frankly shocked me, when shown by a PhD student in a lecture, I&#8217;m still having trouble figuring out exactly how it managed to work!</p>
<p>I still love the simplicity of the Fibonacci number generator that relies on this principle:<br />
<code>fibs = 0 : 1 : zipWith (+) fibs (tail fibs)</code></p>
]]></content:encoded>
	</item>
</channel>
</rss>

