<?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 for Kungfuice.com</title>
	<atom:link href="http://www.kungfuice.com/index.php/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.kungfuice.com</link>
	<description>The Ramblings Of A Programmer</description>
	<lastBuildDate>Sun, 14 Jun 2009 00:09:10 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on USB Missile Launcher Application by New Hardware &#171; Adam Sweet&#8217;s Blog</title>
		<link>http://www.kungfuice.com/index.php/2007/01/10/usb-missile-launcher-application/comment-page-1/#comment-592</link>
		<dc:creator>New Hardware &#171; Adam Sweet&#8217;s Blog</dc:creator>
		<pubDate>Sun, 14 Jun 2009 00:09:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/index.php/2007/01/10/usb-missile-launcher-application/#comment-592</guid>
		<description>[...] a Dream Cheeky Missle Launcher, for which I never found a GUI control tool under Linux. I never got that guy&#8217;s code to work before, it would always fall over when configuring or trying to compile. Tonight I [...]</description>
		<content:encoded><![CDATA[<p>[...] a Dream Cheeky Missle Launcher, for which I never found a GUI control tool under Linux. I never got that guy&#8217;s code to work before, it would always fall over when configuring or trying to compile. Tonight I [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tail Recursive Algorithms In Scala by kungfuice</title>
		<link>http://www.kungfuice.com/index.php/2008/09/18/tail-recursive-algorithms-in-scala/comment-page-1/#comment-583</link>
		<dc:creator>kungfuice</dc:creator>
		<pubDate>Sun, 08 Feb 2009 05:05:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=88#comment-583</guid>
		<description>@Amal  This is true.  Since the Java Virtual Machine has no way of optimizing tail recursive functions it is solely up to the Scala compiler to detect tail call recursive functions and reorder them into iterative functions.  Unfortunately if you do anything fancy in your tail-recursion.  Basically any function that ends in an indirect function call.  Really tail-call optimization in Scala is limited to any function that calls itself (and only itself) directly as its last operation, without going through a function value.</description>
		<content:encoded><![CDATA[<p>@Amal  This is true.  Since the Java Virtual Machine has no way of optimizing tail recursive functions it is solely up to the Scala compiler to detect tail call recursive functions and reorder them into iterative functions.  Unfortunately if you do anything fancy in your tail-recursion.  Basically any function that ends in an indirect function call.  Really tail-call optimization in Scala is limited to any function that calls itself (and only itself) directly as its last operation, without going through a function value.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tail Recursive Algorithms In Scala by Amal</title>
		<link>http://www.kungfuice.com/index.php/2008/09/18/tail-recursive-algorithms-in-scala/comment-page-1/#comment-581</link>
		<dc:creator>Amal</dc:creator>
		<pubDate>Fri, 23 Jan 2009 15:08:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=88#comment-581</guid>
		<description>I am just trying to make sure that I get it right. You meant by the optimization that it can reuse the stack frame over and over, right?. But you mentioned that it does not always detect that optimization even if the program was written as tail recursive?</description>
		<content:encoded><![CDATA[<p>I am just trying to make sure that I get it right. You meant by the optimization that it can reuse the stack frame over and over, right?. But you mentioned that it does not always detect that optimization even if the program was written as tail recursive?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ext-JS Tasks &amp; Progressbars a match made in heaven by Joshua</title>
		<link>http://www.kungfuice.com/index.php/2008/10/29/ext-js-tasks-progressbars-a-match-made-in-heaven/comment-page-1/#comment-580</link>
		<dc:creator>Joshua</dc:creator>
		<pubDate>Sun, 07 Dec 2008 16:01:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=93#comment-580</guid>
		<description>So where is the post about &quot;how you can implement a comet based Servlet in Tomcat 6 and create a client that will listen for updates from the server&quot;?

Nice post though.</description>
		<content:encoded><![CDATA[<p>So where is the post about &#8220;how you can implement a comet based Servlet in Tomcat 6 and create a client that will listen for updates from the server&#8221;?</p>
<p>Nice post though.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ext-JS Tasks &amp; Progressbars a match made in heaven by kungfuice</title>
		<link>http://www.kungfuice.com/index.php/2008/10/29/ext-js-tasks-progressbars-a-match-made-in-heaven/comment-page-1/#comment-557</link>
		<dc:creator>kungfuice</dc:creator>
		<pubDate>Fri, 07 Nov 2008 02:43:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=93#comment-557</guid>
		<description>Thanks Ian,

I fixed the missing semi colon :)</description>
		<content:encoded><![CDATA[<p>Thanks Ian,</p>
<p>I fixed the missing semi colon <img src='http://www.kungfuice.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ext-JS Tasks &amp; Progressbars a match made in heaven by Daily del.icio.us for October 29th through November 1st &#8212; Vinny Carpenter's blog</title>
		<link>http://www.kungfuice.com/index.php/2008/10/29/ext-js-tasks-progressbars-a-match-made-in-heaven/comment-page-1/#comment-556</link>
		<dc:creator>Daily del.icio.us for October 29th through November 1st &#8212; Vinny Carpenter's blog</dc:creator>
		<pubDate>Sun, 02 Nov 2008 02:01:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=93#comment-556</guid>
		<description>[...] Kungfuice.com &#187; Blog Archive &#187; Ext-JS Tasks &amp; Progressbars a match made in heaven - Using Ext-JS this task was actually a lot easier then I had originally thought. Ext has these two great classes called TaskRunner and TaskManager. These classes basically allow you to create a task for execution in a multithreaded manner [...]</description>
		<content:encoded><![CDATA[<p>[...] Kungfuice.com &raquo; Blog Archive &raquo; Ext-JS Tasks &amp; Progressbars a match made in heaven &#8211; Using Ext-JS this task was actually a lot easier then I had originally thought. Ext has these two great classes called TaskRunner and TaskManager. These classes basically allow you to create a task for execution in a multithreaded manner [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ext-JS Tasks &amp; Progressbars a match made in heaven by Ian</title>
		<link>http://www.kungfuice.com/index.php/2008/10/29/ext-js-tasks-progressbars-a-match-made-in-heaven/comment-page-1/#comment-555</link>
		<dc:creator>Ian</dc:creator>
		<pubDate>Sat, 01 Nov 2008 01:00:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=93#comment-555</guid>
		<description>Probable missing colon (&quot;:&quot;) typo in the second section of code:

 -interval 10000 //10 seconds

 +interval: 10000 //10 seconds</description>
		<content:encoded><![CDATA[<p>Probable missing colon (&#8221;:&#8221;) typo in the second section of code:</p>
<p> -interval 10000 //10 seconds</p>
<p> +interval: 10000 //10 seconds</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ext-JS Tasks &amp; Progressbars a match made in heaven by Ext-JS Tasks &#38; Progressbars a Match Made in Heaven &#124; Code Snippets : Claude Betancourt's Technical Blog</title>
		<link>http://www.kungfuice.com/index.php/2008/10/29/ext-js-tasks-progressbars-a-match-made-in-heaven/comment-page-1/#comment-553</link>
		<dc:creator>Ext-JS Tasks &#38; Progressbars a Match Made in Heaven &#124; Code Snippets : Claude Betancourt's Technical Blog</dc:creator>
		<pubDate>Wed, 29 Oct 2008 16:25:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=93#comment-553</guid>
		<description>[...] Boersma posted this example of using TaskRunner and TaskManager to keep a user informed while a task is handled [...]</description>
		<content:encoded><![CDATA[<p>[...] Boersma posted this example of using TaskRunner and TaskManager to keep a user informed while a task is handled [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tail Recursive Algorithms In Scala by Bill Allen</title>
		<link>http://www.kungfuice.com/index.php/2008/09/18/tail-recursive-algorithms-in-scala/comment-page-1/#comment-543</link>
		<dc:creator>Bill Allen</dc:creator>
		<pubDate>Fri, 26 Sep 2008 16:04:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=88#comment-543</guid>
		<description>The whole point of the tail recursion optimization is that the compiler removes the function calls effectively rewriting the algorithm to be an efficient loop.</description>
		<content:encoded><![CDATA[<p>The whole point of the tail recursion optimization is that the compiler removes the function calls effectively rewriting the algorithm to be an efficient loop.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tail Recursive Algorithms In Scala by Paul Copeland</title>
		<link>http://www.kungfuice.com/index.php/2008/09/18/tail-recursive-algorithms-in-scala/comment-page-1/#comment-542</link>
		<dc:creator>Paul Copeland</dc:creator>
		<pubDate>Fri, 26 Sep 2008 05:30:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.kungfuice.com/?p=88#comment-542</guid>
		<description>Even though there is no &quot;deferred execution&quot; there are the same number of nested function calls and presumably the same depth of the stack in the second case unless the system does some kind of rewriting.  The usual examples show that tail recursion can always be rewritten by the programmer with a loop. Many useful recursive algorithms cannot be reduced to tail recursion and there is no simple way to remove the recursion.</description>
		<content:encoded><![CDATA[<p>Even though there is no &#8220;deferred execution&#8221; there are the same number of nested function calls and presumably the same depth of the stack in the second case unless the system does some kind of rewriting.  The usual examples show that tail recursion can always be rewritten by the programmer with a loop. Many useful recursive algorithms cannot be reduced to tail recursion and there is no simple way to remove the recursion.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
