<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Comments on snippet: 'Fibonacci List One-Liner in Haskell'</title>
<link>http://snipplr.com</link>
<description>Snipplr comments feed'</description>
<language>en-us</language>
<pubDate>Wed, 22 May 2013 02:22:42 GMT</pubDate>
<item>
<title>deepsoul said on 7/11/11</title>
<link>http://snipplr.com/view/54657/fibonacci-list-oneliner-in-haskell/</link>
<description><![CDATA[ You did not mention the most remarkable thing about this: It avoids computing each element many times, as a naive recursive implementation would.  This is because Haskell memoizes (caches) constant definitions. ]]></description>
<pubDate>Mon, 11 Jul 2011 06:15:35 GMT</pubDate>
<guid>http://snipplr.com/view/54657/fibonacci-list-oneliner-in-haskell/</guid>
</item>
</channel>
</rss>