<?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: Tail recursion in Python</title>
	<atom:link href="http://paulbutler.org/archives/tail-recursion-in-python/feed/" rel="self" type="application/rss+xml" />
	<link>http://paulbutler.org/archives/tail-recursion-in-python/</link>
	<description></description>
	<lastBuildDate>Sun, 16 Oct 2011 08:56:20 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Rich Katz</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-192</link>
		<dc:creator>Rich Katz</dc:creator>
		<pubDate>Tue, 31 Mar 2009 18:32:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-192</guid>
		<description>See Python Tail Recursion Decorators.

For instance:

http://code.activestate.com/recipes/496691/

Regards,

Rich</description>
		<content:encoded><![CDATA[<p>See Python Tail Recursion Decorators.</p>
<p>For instance:</p>
<p><a href="http://code.activestate.com/recipes/496691/" rel="nofollow">http://code.activestate.com/recipes/496691/</a></p>
<p>Regards,</p>
<p>Rich</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paul Butler</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-189</link>
		<dc:creator>Paul Butler</dc:creator>
		<pubDate>Mon, 30 Mar 2009 21:45:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-189</guid>
		<description>ythefoe, that works, but only if you have the memory and you know in advance an upper bound on the size of the stack. Neither of these are always the case.</description>
		<content:encoded><![CDATA[<p>ythefoe, that works, but only if you have the memory and you know in advance an upper bound on the size of the stack. Neither of these are always the case.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paul Butler</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-188</link>
		<dc:creator>Paul Butler</dc:creator>
		<pubDate>Mon, 30 Mar 2009 21:42:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-188</guid>
		<description>Brian, thanks. Stackless looks pretty cool.</description>
		<content:encoded><![CDATA[<p>Brian, thanks. Stackless looks pretty cool.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Stoll</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-187</link>
		<dc:creator>Greg Stoll</dc:creator>
		<pubDate>Mon, 30 Mar 2009 21:31:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-187</guid>
		<description>Interesting technique - thanks!</description>
		<content:encoded><![CDATA[<p>Interesting technique &#8211; thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ythefoe</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-186</link>
		<dc:creator>ythefoe</dc:creator>
		<pubDate>Mon, 30 Mar 2009 20:54:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-186</guid>
		<description>Why not setting your recursion limit higher?
From the python doc:

sys.setrecursionlimit(limit)

    Set the maximum depth of the Python interpreter stack to limit. This limit prevents infinite recursion from causing an overflow of the C stack and crashing Python.

    The highest possible limit is platform-dependent. A user may need to set the limit higher when she has a program that requires deep recursion and a platform that supports a higher limit. This should be done with care, because a too-high limit can lead to a crash.</description>
		<content:encoded><![CDATA[<p>Why not setting your recursion limit higher?<br />
From the python doc:</p>
<p>sys.setrecursionlimit(limit)</p>
<p>    Set the maximum depth of the Python interpreter stack to limit. This limit prevents infinite recursion from causing an overflow of the C stack and crashing Python.</p>
<p>    The highest possible limit is platform-dependent. A user may need to set the limit higher when she has a program that requires deep recursion and a platform that supports a higher limit. This should be done with care, because a too-high limit can lead to a crash.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pádraig Brady</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-185</link>
		<dc:creator>Pádraig Brady</dc:creator>
		<pubDate>Mon, 30 Mar 2009 09:46:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-185</guid>
		<description>So you explicitly store state rather than implicitly on the stack. This is better as I noted here:
http://www.pixelbeat.org/programming/functional_python_state.html</description>
		<content:encoded><![CDATA[<p>So you explicitly store state rather than implicitly on the stack. This is better as I noted here:<br />
<a href="http://www.pixelbeat.org/programming/functional_python_state.html" rel="nofollow">http://www.pixelbeat.org/programming/functional_python_state.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: popurls.com // popular today</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-184</link>
		<dc:creator>popurls.com // popular today</dc:creator>
		<pubDate>Mon, 30 Mar 2009 09:40:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-184</guid>
		<description>&lt;strong&gt;popurls.com // popular today...&lt;/strong&gt;

story has entered the popular today section on popurls.com...</description>
		<content:encoded><![CDATA[<p><strong>popurls.com // popular today&#8230;</strong></p>
<p>story has entered the popular today section on popurls.com&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: username223</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-183</link>
		<dc:creator>username223</dc:creator>
		<pubDate>Mon, 30 Mar 2009 09:09:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-183</guid>
		<description>&quot;a = a()&quot;?  Objectivist? ;-)</description>
		<content:encoded><![CDATA[<p>&#8220;a = a()&#8221;?  Objectivist? ;-)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: praxis' me2DAY</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-182</link>
		<dc:creator>praxis' me2DAY</dc:creator>
		<pubDate>Mon, 30 Mar 2009 08:43:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-182</guid>
		<description>&lt;strong&gt;praxis? ??...&lt;/strong&gt;

tail recursion in python, ??? ?? ???....</description>
		<content:encoded><![CDATA[<p><strong>praxis? ??&#8230;</strong></p>
<p>tail recursion in python, ??? ?? ???&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: praxis' me2DAY</title>
		<link>http://paulbutler.org/archives/tail-recursion-in-python/#comment-195</link>
		<dc:creator>praxis' me2DAY</dc:creator>
		<pubDate>Mon, 30 Mar 2009 08:43:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.paulbutler.org/archives/tail-recursion-in-python/#comment-195</guid>
		<description>&lt;strong&gt;praxis? ??...&lt;/strong&gt;

tail recursion in python, ??? ?? ???....</description>
		<content:encoded><![CDATA[<p><strong>praxis? ??&#8230;</strong></p>
<p>tail recursion in python, ??? ?? ???&#8230;.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

