<?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/"
		>
<channel>
	<title>Comments on: F#: Word Count using a Dictionary</title>
	<atom:link href="http://www.markhneedham.com/blog/2009/12/20/f-word-count-using-a-dictionary/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.markhneedham.com/blog/2009/12/20/f-word-count-using-a-dictionary/</link>
	<description>Thoughts on Software Development</description>
	<lastBuildDate>Sat, 11 Feb 2012 23:17:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Jon Harrop</title>
		<link>http://www.markhneedham.com/blog/2009/12/20/f-word-count-using-a-dictionary/comment-page-1/#comment-28790</link>
		<dc:creator>Jon Harrop</dc:creator>
		<pubDate>Tue, 22 Dec 2009 03:36:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.markhneedham.com/blog/?p=1959#comment-28790</guid>
		<description>I guess your problem with stack overflows stems from your use of Seq.append which concatenates IEnumerables. Ironically, this is a source of stack overflows because it is written in C# code and, consequently, does not use tail calls. Traversing a sequence composed in this way leaks stack space and eventually overflows the stack.

I have written a more idiomatic and efficient F# solution:

http://fsharpnews.blogspot.com/2009/12/zach-cox-word-count-challenge.html</description>
		<content:encoded><![CDATA[<p>I guess your problem with stack overflows stems from your use of Seq.append which concatenates IEnumerables. Ironically, this is a source of stack overflows because it is written in C# code and, consequently, does not use tail calls. Traversing a sequence composed in this way leaks stack space and eventually overflows the stack.</p>
<p>I have written a more idiomatic and efficient F# solution:</p>
<p><a href="http://fsharpnews.blogspot.com/2009/12/zach-cox-word-count-challenge.html" rel="nofollow">http://fsharpnews.blogspot.com/2009/12/zach-cox-word-count-challenge.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rick Minerich's Development Wonderland : F# Discoveries This Week 12/21/2009</title>
		<link>http://www.markhneedham.com/blog/2009/12/20/f-word-count-using-a-dictionary/comment-page-1/#comment-28766</link>
		<dc:creator>Rick Minerich's Development Wonderland : F# Discoveries This Week 12/21/2009</dc:creator>
		<pubDate>Mon, 21 Dec 2009 17:11:22 +0000</pubDate>
		<guid isPermaLink="false">http://www.markhneedham.com/blog/?p=1959#comment-28766</guid>
		<description>[...] Mark Needham does Word Count using a Dictionary [...]</description>
		<content:encoded><![CDATA[<p>[...] Mark Needham does Word Count using a Dictionary [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tweets that mention F#: Word Count using a Dictionary at Mark Needham -- Topsy.com</title>
		<link>http://www.markhneedham.com/blog/2009/12/20/f-word-count-using-a-dictionary/comment-page-1/#comment-28698</link>
		<dc:creator>Tweets that mention F#: Word Count using a Dictionary at Mark Needham -- Topsy.com</dc:creator>
		<pubDate>Sun, 20 Dec 2009 10:17:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.markhneedham.com/blog/?p=1959#comment-28698</guid>
		<description>[...] This post was mentioned on Twitter by Mark Needham, planettw. planettw said: Mark Needham: F#: Word Count using a Dictionary: Having spent some time unsuccessfully trying to make my F# attempt... http://bit.ly/7XnPMd [...]</description>
		<content:encoded><![CDATA[<p>[...] This post was mentioned on Twitter by Mark Needham, planettw. planettw said: Mark Needham: F#: Word Count using a Dictionary: Having spent some time unsuccessfully trying to make my F# attempt&#8230; <a href="http://bit.ly/7XnPMd" rel="nofollow">http://bit.ly/7XnPMd</a> [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

