<?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: Erlang FizzBuzz Showdown (Pt 1)</title>
	<atom:link href="http://www.joelhughes.co.uk/blog/2009/05/erlang-fizzbuzz-showdown-pt-1/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.joelhughes.co.uk/blog/2009/05/erlang-fizzbuzz-showdown-pt-1/</link>
	<description></description>
	<lastBuildDate>Wed, 10 Feb 2010 12:06:25 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: iWantToKeepAnon</title>
		<link>http://www.joelhughes.co.uk/blog/2009/05/erlang-fizzbuzz-showdown-pt-1/comment-page-1/#comment-9</link>
		<dc:creator>iWantToKeepAnon</dc:creator>
		<pubDate>Sat, 16 May 2009 03:48:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.joelhughes.co.uk/blog/?p=40#comment-9</guid>
		<description>&gt; I was a little surprised that I&lt;br&gt;&gt; couldn’t just launch into it.&lt;br&gt;&lt;br&gt;More like *chose* not to.  Sounds like a list comprehension would have worked fabulously.  Just cuz you *wanted* to show tail recursion doesn&#039;t mean there ISNT a built in language construct.  List comprehensions are a WONDERFUL way to go about what you just did manually.&lt;br&gt;&lt;br&gt;Also I don&#039;t think you need the gaurd ... when &#039;range(To,To,List)&#039; matches there will be no more recursion.  In fact that is the classic way to STOP a loop.  Hmmmm.... am I missing something?&lt;br&gt;&lt;br&gt;This isn&#039;t a bad intro but slightly off center IMO.&lt;br&gt;&lt;br&gt;list comprehension:&lt;br&gt;&lt;br&gt;init() -&gt;&lt;br&gt;    [word(X) &#124;&#124; X &lt;- lists:seq(1, 100)].&lt;br&gt;&lt;br&gt;(for a proper definition of &#039;word()&#039; and you could replace lists:seq w/ a roll your own tail recursion if you wanted to illustrate that).</description>
		<content:encoded><![CDATA[<p>&gt; I was a little surprised that I<br />&gt; couldn’t just launch into it.</p>
<p>More like *chose* not to.  Sounds like a list comprehension would have worked fabulously.  Just cuz you *wanted* to show tail recursion doesn&#39;t mean there ISNT a built in language construct.  List comprehensions are a WONDERFUL way to go about what you just did manually.</p>
<p>Also I don&#39;t think you need the gaurd &#8230; when &#39;range(To,To,List)&#39; matches there will be no more recursion.  In fact that is the classic way to STOP a loop.  Hmmmm&#8230;. am I missing something?</p>
<p>This isn&#39;t a bad intro but slightly off center IMO.</p>
<p>list comprehension:</p>
<p>init() -&gt;<br />    [word(X) || X &lt;- lists:seq(1, 100)].</p>
<p>(for a proper definition of &#39;word()&#39; and you could replace lists:seq w/ a roll your own tail recursion if you wanted to illustrate that).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: joelhughes</title>
		<link>http://www.joelhughes.co.uk/blog/2009/05/erlang-fizzbuzz-showdown-pt-1/comment-page-1/#comment-5</link>
		<dc:creator>joelhughes</dc:creator>
		<pubDate>Thu, 14 May 2009 19:17:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.joelhughes.co.uk/blog/?p=40#comment-5</guid>
		<description>Thanks Daniel, I was aware of the lists module but chose not to use it in order to cover the basics of tail-recursion (and compare the implementation with Python/PHP/Ruby).&lt;br&gt;&lt;br&gt;I hope that clarifies it a bit.</description>
		<content:encoded><![CDATA[<p>Thanks Daniel, I was aware of the lists module but chose not to use it in order to cover the basics of tail-recursion (and compare the implementation with Python/PHP/Ruby).</p>
<p>I hope that clarifies it a bit.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Hepper</title>
		<link>http://www.joelhughes.co.uk/blog/2009/05/erlang-fizzbuzz-showdown-pt-1/comment-page-1/#comment-4</link>
		<dc:creator>Daniel Hepper</dc:creator>
		<pubDate>Thu, 14 May 2009 19:01:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.joelhughes.co.uk/blog/?p=40#comment-4</guid>
		<description>Instead of building your own range function, you could use lists:seq(From, To)&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://www.erlang.org/doc/man/lists.html#seq-2&quot; rel=&quot;nofollow&quot;&gt;http://www.erlang.org/doc/man/lists.html#seq-2&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>Instead of building your own range function, you could use lists:seq(From, To)</p>
<p><a href="http://www.erlang.org/doc/man/lists.html#seq-2" rel="nofollow">http://www.erlang.org/doc/man/lists.html#seq-2</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Joel Hughes&#8217;s Blog &#187; Erlang FizzBuzz Showdown (pt2)</title>
		<link>http://www.joelhughes.co.uk/blog/2009/05/erlang-fizzbuzz-showdown-pt-1/comment-page-1/#comment-2</link>
		<dc:creator>Joel Hughes&#8217;s Blog &#187; Erlang FizzBuzz Showdown (pt2)</dc:creator>
		<pubDate>Thu, 14 May 2009 11:39:34 +0000</pubDate>
		<guid isPermaLink="false">http://www.joelhughes.co.uk/blog/?p=40#comment-2</guid>
		<description>[...] my last post I documented some of the steps involved in building a simple FizzBuzz script in Erlang and compared the code to its equivalents in Python, Ruby and PHP. So far we&#8217;ve simply covered [...]</description>
		<content:encoded><![CDATA[<p>[...] my last post I documented some of the steps involved in building a simple FizzBuzz script in Erlang and compared the code to its equivalents in Python, Ruby and PHP. So far we&#8217;ve simply covered [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
