<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Toolchest: Shortcuts for higher-order functions</title>
	<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/</link>
	<description></description>
	<pubDate>Tue, 18 Nov 2008 15:15:22 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Michael T</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-687</link>
		<dc:creator>Michael T</dc:creator>
		<pubDate>Tue, 08 Jan 2008 01:43:31 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-687</guid>
		<description>Lambda can indeed be used to represent recursive functions.  That is the point of the Y combinator, after all.   Although your point is still well taken for every day programming.  The recursive representation of factorial using only lambdas - no side effects in the environment - is not the first way most people would think to do it.   So when you say 'cannot be used to represent recursive functions', I agree if you mean 'no sane person would use it to represent recursive in code other people would read'.  But in an absolute sense, you CAN represent recursive functions using lambdas.</description>
		<content:encoded><![CDATA[<p>Lambda can indeed be used to represent recursive functions.  That is the point of the Y combinator, after all.   Although your point is still well taken for every day programming.  The recursive representation of factorial using only lambdas - no side effects in the environment - is not the first way most people would think to do it.   So when you say &#8216;cannot be used to represent recursive functions&#8217;, I agree if you mean &#8216;no sane person would use it to represent recursive in code other people would read&#8217;.  But in an absolute sense, you CAN represent recursive functions using lambdas.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Szymon</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-648</link>
		<dc:creator>Szymon</dc:creator>
		<pubDate>Tue, 18 Dec 2007 08:55:18 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-648</guid>
		<description>Why not:

(mapcar (* 2 _) ‘(1 2 3))

?</description>
		<content:encoded><![CDATA[<p>Why not:</p>
<p>(mapcar (* 2 _) ‘(1 2 3))</p>
<p>?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mork</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-647</link>
		<dc:creator>Mork</dc:creator>
		<pubDate>Tue, 18 Dec 2007 05:11:43 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-647</guid>
		<description>I don't understand why anybody would choose 'for' if aiming for conciseness: It is neither particularly short nor descriptive (if three-letter names are necessary (it eludes me why that might be), 'fun' strikes me as a better compromise).

Why not use the Greek lambda character (λ) itself? Any useful editor or operating system should provide shortcuts to insert that character with at most two keystrokes.
But since I've never found it a problem to type out 'lambda', I prefer Emacs' pretty-lambda mode: You type (lambda (x) ...) and it displays as (λ (x) ...) -- the actual source code is not modified, only the way 'lambda' is displayed on screen. This works with all existing code, it doesn't require any custom set-up other than a line or two in your .emacs,  and it doesn't confuse anybody else reading your code.</description>
		<content:encoded><![CDATA[<p>I don&#8217;t understand why anybody would choose &#8216;for&#8217; if aiming for conciseness: It is neither particularly short nor descriptive (if three-letter names are necessary (it eludes me why that might be), &#8216;fun&#8217; strikes me as a better compromise).</p>
<p>Why not use the Greek lambda character (λ) itself? Any useful editor or operating system should provide shortcuts to insert that character with at most two keystrokes.<br />
But since I&#8217;ve never found it a problem to type out &#8216;lambda&#8217;, I prefer Emacs&#8217; pretty-lambda mode: You type (lambda (x) &#8230;) and it displays as (λ (x) &#8230;) &#8212; the actual source code is not modified, only the way &#8216;lambda&#8217; is displayed on screen. This works with all existing code, it doesn&#8217;t require any custom set-up other than a line or two in your .emacs,  and it doesn&#8217;t confuse anybody else reading your code.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-646</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Tue, 18 Dec 2007 05:04:53 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-646</guid>
		<description>@_deepfire: Any suggestions for a choice of letters?</description>
		<content:encoded><![CDATA[<p>@_deepfire: Any suggestions for a choice of letters?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-645</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Tue, 18 Dec 2007 04:18:01 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-645</guid>
		<description>Here is a description and explanation of the CUT macro:

http://srfi.schemers.org/srfi-26/srfi-26.html</description>
		<content:encoded><![CDATA[<p>Here is a description and explanation of the CUT macro:</p>
<p><a href="http://srfi.schemers.org/srfi-26/srfi-26.html" rel="nofollow">http://srfi.schemers.org/srfi-26/srfi-26.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: _deepfire</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-644</link>
		<dc:creator>_deepfire</dc:creator>
		<pubDate>Tue, 18 Dec 2007 00:23:49 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-644</guid>
		<description>Ok, I messed up the letters in the previous comment, but the problem should be obvious by now -- that specific choice of letters isn't providing a terribly clear idea about what's happening.</description>
		<content:encoded><![CDATA[<p>Ok, I messed up the letters in the previous comment, but the problem should be obvious by now &#8212; that specific choice of letters isn&#8217;t providing a terribly clear idea about what&#8217;s happening.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: _deepfire</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-643</link>
		<dc:creator>_deepfire</dc:creator>
		<pubDate>Tue, 18 Dec 2007 00:21:08 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-643</guid>
		<description>#L being CURRY asks for a RCURRY companion, but #R is already taken..</description>
		<content:encoded><![CDATA[<p>#L being CURRY asks for a RCURRY companion, but #R is already taken..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matthew Swank</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-642</link>
		<dc:creator>Matthew Swank</dc:creator>
		<pubDate>Mon, 17 Dec 2007 23:28:42 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-642</guid>
		<description>Here's is another implementation of cut/cute based closely on the srfi-26 reference implementation: http://paste.lisp.org/display/52700</description>
		<content:encoded><![CDATA[<p>Here&#8217;s is another implementation of cut/cute based closely on the srfi-26 reference implementation: <a href="http://paste.lisp.org/display/52700" rel="nofollow">http://paste.lisp.org/display/52700</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-641</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Mon, 17 Dec 2007 18:54:46 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-641</guid>
		<description>@Mark: There's some extra code required.  I linked to it in the introduction, but here it is again:

http://paste.lisp.org/display/52651</description>
		<content:encoded><![CDATA[<p>@Mark: There&#8217;s some extra code required.  I linked to it in the introduction, but here it is again:</p>
<p><a href="http://paste.lisp.org/display/52651" rel="nofollow">http://paste.lisp.org/display/52651</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-640</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Mon, 17 Dec 2007 18:33:54 +0000</pubDate>
		<guid>http://www.lispcast.com/wordpress/2007/12/toolchest-shortcuts-for-higher-order-functions/#comment-640</guid>
		<description>I'd just use (mapcar (lambda (x) (* x 2)) list).  If that's too "long-winded", I suggest you give pretty-lambdas.el a try.</description>
		<content:encoded><![CDATA[<p>I&#8217;d just use (mapcar (lambda (x) (* x 2)) list).  If that&#8217;s too &#8220;long-winded&#8221;, I suggest you give pretty-lambdas.el a try.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
