<?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: Deriving the Y combinator</title>
	<atom:link href="http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/</link>
	<description>This dirt was a building before</description>
	<lastBuildDate>Tue, 09 Mar 2010 11:44:32 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Answer My Searches &#187; Blog Archive &#187; Mini Searches with Answers</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-3854</link>
		<dc:creator>Answer My Searches &#187; Blog Archive &#187; Mini Searches with Answers</dc:creator>
		<pubDate>Mon, 30 Nov 2009 17:34:34 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-3854</guid>
		<description>[...] Somewhat Coherent Explanation of What is a Y CombinatorI guess it&#8217;s a way to use recursion without calling the function by name. I&#8217;m not sure why you would ever need to do that though. [...]</description>
		<content:encoded><![CDATA[<p>[...] Somewhat Coherent Explanation of What is a Y CombinatorI guess it&#8217;s a way to use recursion without calling the function by name. I&#8217;m not sure why you would ever need to do that though. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nick Black</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-3778</link>
		<dc:creator>Nick Black</dc:creator>
		<pubDate>Wed, 21 Oct 2009 08:30:43 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-3778</guid>
		<description>a very solid article -- keep writing! -- but i liked this most of all:

&quot;be aware I’m mostly writing this to force myself to understand something by writing it down. If you get anything out of it, consider it a bonus.&quot;

if you don&#039;t mind, i&#039;m appropriating this for my own wiki, posthaste.</description>
		<content:encoded><![CDATA[<p>a very solid article &#8212; keep writing! &#8212; but i liked this most of all:</p>
<p>&#8220;be aware I’m mostly writing this to force myself to understand something by writing it down. If you get anything out of it, consider it a bonus.&#8221;</p>
<p>if you don&#8217;t mind, i&#8217;m appropriating this for my own wiki, posthaste.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rodney King</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-3611</link>
		<dc:creator>Rodney King</dc:creator>
		<pubDate>Wed, 09 Sep 2009 11:34:56 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-3611</guid>
		<description>Excellent post -- thanks for writing it. One curiousity in your webpage itself - you use &quot;&lt;code&gt;&quot; for the code bits. I&#039;d have thought: one tag or the other, but not both.&lt;/code&gt;</description>
		<content:encoded><![CDATA[<p>Excellent post &#8212; thanks for writing it. One curiousity in your webpage itself &#8211; you use &#8220;<code>" for the code bits. I'd have thought: one tag or the other, but not both.</code></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JavaScript: The Good Parts - Push cx</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-3502</link>
		<dc:creator>JavaScript: The Good Parts - Push cx</dc:creator>
		<pubDate>Tue, 09 Jun 2009 12:09:09 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-3502</guid>
		<description>[...] Y combinator, which allows creating recursive anonymous functions. There&#8217;s a blog post with a nice derivation, but it seems oddly absent from the [...]</description>
		<content:encoded><![CDATA[<p>[...] Y combinator, which allows creating recursive anonymous functions. There&#8217;s a blog post with a nice derivation, but it seems oddly absent from the [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: -= Linkage 2008.02.08 =-</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-3428</link>
		<dc:creator>-= Linkage 2008.02.08 =-</dc:creator>
		<pubDate>Mon, 26 Jan 2009 15:38:53 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-3428</guid>
		<description>[...] Deriving the S-combinator&lt;br/&gt; [...]</description>
		<content:encoded><![CDATA[<p>[...] Deriving the S-combinator&lt;br/&gt; [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lambdaphant / Playing Catch-up</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-2808</link>
		<dc:creator>Lambdaphant / Playing Catch-up</dc:creator>
		<pubDate>Sun, 10 Feb 2008 18:36:47 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-2808</guid>
		<description>[...] some other stuff that I&#039;ve been reading. At Arc fn Ken has a great post about the internals of Arc. This post helped me get a better grasp of the Y [...]</description>
		<content:encoded><![CDATA[<p>[...] some other stuff that I&#8217;ve been reading. At Arc fn Ken has a great post about the internals of Arc. This post helped me get a better grasp of the Y [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sp3w</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-2802</link>
		<dc:creator>Sp3w</dc:creator>
		<pubDate>Fri, 08 Feb 2008 13:45:58 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-2802</guid>
		<description>[...] Deriving the S-combinator [...]</description>
		<content:encoded><![CDATA[<p>[...] Deriving the S-combinator [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott Williams</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-2790</link>
		<dc:creator>Scott Williams</dc:creator>
		<pubDate>Wed, 06 Feb 2008 23:31:09 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-2790</guid>
		<description>Thank for the iterative explanation. I think I have my brain wrapped around it.  When exactly in the real world is this useful though?</description>
		<content:encoded><![CDATA[<p>Thank for the iterative explanation. I think I have my brain wrapped around it.  When exactly in the real world is this useful though?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oliver</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-2780</link>
		<dc:creator>oliver</dc:creator>
		<pubDate>Wed, 06 Feb 2008 04:06:14 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-2780</guid>
		<description>Slightly off topic a faster way to do self recursion without a dependency on a global variable is to use a named function (using your example):
var factorial = function f(x) {
  return x == 0 ? 1 : x * f(x-1);
};

where &#039;f&#039; will be scoped only to the function body... functionally this is equivalent to:
var factorial = function (x) {
  var f = arguments.callee;
  return x == 0 ? 1 : x * f(x-1);
};

Albeit slightly more efficient (you&#039;d need to be using f a lot to make the lookup cost significant).

--Oliver</description>
		<content:encoded><![CDATA[<p>Slightly off topic a faster way to do self recursion without a dependency on a global variable is to use a named function (using your example):<br />
var factorial = function f(x) {<br />
  return x == 0 ? 1 : x * f(x-1);<br />
};</p>
<p>where &#8216;f&#8217; will be scoped only to the function body&#8230; functionally this is equivalent to:<br />
var factorial = function (x) {<br />
  var f = arguments.callee;<br />
  return x == 0 ? 1 : x * f(x-1);<br />
};</p>
<p>Albeit slightly more efficient (you&#8217;d need to be using f a lot to make the lookup cost significant).</p>
<p>&#8211;Oliver</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Schneider</title>
		<link>http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/comment-page-1/#comment-2776</link>
		<dc:creator>Chris Schneider</dc:creator>
		<pubDate>Tue, 05 Feb 2008 23:05:14 +0000</pubDate>
		<guid isPermaLink="false">http://blog.jcoglan.com/2008/01/10/deriving-the-y-combinator/#comment-2776</guid>
		<description>Thank you for your explanation.  It was very clear, the clearest I&#039;ve seen for this.  I&#039;ll have to reread it later to really get it, but you did a great job describing and deriving.</description>
		<content:encoded><![CDATA[<p>Thank you for your explanation.  It was very clear, the clearest I&#8217;ve seen for this.  I&#8217;ll have to reread it later to really get it, but you did a great job describing and deriving.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
