<?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: List comprehensions in Common Lisp</title>
	<atom:link href="http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/</link>
	<description>A glimpse into my visual space</description>
	<lastBuildDate>Tue, 09 Feb 2010 03:08:29 +0100</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Rörd</title>
		<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/comment-page-1/#comment-66</link>
		<dc:creator>Rörd</dc:creator>
		<pubDate>Thu, 19 Nov 2009 22:46:57 +0000</pubDate>
		<guid isPermaLink="false">http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/#comment-66</guid>
		<description>It seems as though posting the link within a tag doesn&#039;t work. So here&#039;s the URL to the repository:
http://bitbucket.org/roerd/series-comprehension/</description>
		<content:encoded><![CDATA[<p>It seems as though posting the link within a tag doesn&#8217;t work. So here&#8217;s the URL to the repository:<br />
<a href="http://bitbucket.org/roerd/series-comprehension/" rel="nofollow">http://bitbucket.org/roerd/series-comprehension/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rörd</title>
		<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/comment-page-1/#comment-65</link>
		<dc:creator>Rörd</dc:creator>
		<pubDate>Thu, 19 Nov 2009 22:41:30 +0000</pubDate>
		<guid isPermaLink="false">http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/#comment-65</guid>
		<description>You&#039;ve inspired me to write a series based implementation. It&#039;s available from &lt;a&gt;the Mercurial repository&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>You&#8217;ve inspired me to write a series based implementation. It&#8217;s available from <a>the Mercurial repository</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Janon</title>
		<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/comment-page-1/#comment-36</link>
		<dc:creator>Janon</dc:creator>
		<pubDate>Wed, 21 Nov 2007 16:19:45 +0000</pubDate>
		<guid isPermaLink="false">http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/#comment-36</guid>
		<description>Example #1 in J

1 line
(I.2= /&quot;1 n){[n=.3 3#:i.*:3

3 lines
cp=. 3 3 #: i. *: 3
ix=. I. 2=  /&quot;1 cp
ix { cp

0 2
1 1
2 0

for boxes
&lt;&quot;1 ix { cp
&#124;0 2&#124;1 1&#124;2 0&#124;</description>
		<content:encoded><![CDATA[<p>Example #1 in J</p>
<p>1 line<br />
(I.2= /&#8221;1 n){[n=.3 3#:i.*:3</p>
<p>3 lines<br />
cp=. 3 3 #: i. *: 3<br />
ix=. I. 2=  /&#8221;1 cp<br />
ix { cp</p>
<p>0 2<br />
1 1<br />
2 0</p>
<p>for boxes<br />
&lt;&#8221;1 ix { cp<br />
|0 2|1 1|2 0|</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Moocow Says Moo</title>
		<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/comment-page-1/#comment-35</link>
		<dc:creator>Moocow Says Moo</dc:creator>
		<pubDate>Tue, 20 Nov 2007 18:39:47 +0000</pubDate>
		<guid isPermaLink="false">http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/#comment-35</guid>
		<description>Relevant ref to another ready-to-go list comprehensions library, probably the default one a long-time lisper will reach for first (it is mentioned in Mario&#039;s paper, but he dismisses it because it looks complex and possibly slow, which is rather missing the point: Sven&#039;s focus was on versatility - &quot;Collect&quot; is extensible to work with any lisp type, which nice. Very nice. i.e. it&#039;s &quot;almost anything comprehensions&quot;, not just &quot;list comprehensions&quot;:
http://user.it.uu.se/~svenolof/Collect/</description>
		<content:encoded><![CDATA[<p>Relevant ref to another ready-to-go list comprehensions library, probably the default one a long-time lisper will reach for first (it is mentioned in Mario&#8217;s paper, but he dismisses it because it looks complex and possibly slow, which is rather missing the point: Sven&#8217;s focus was on versatility &#8211; &#8220;Collect&#8221; is extensible to work with any lisp type, which nice. Very nice. i.e. it&#8217;s &#8220;almost anything comprehensions&#8221;, not just &#8220;list comprehensions&#8221;:<br />
<a href="http://user.it.uu.se/~svenolof/Collect/" rel="nofollow">http://user.it.uu.se/~svenolof/Collect/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tac-Tics</title>
		<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/comment-page-1/#comment-38</link>
		<dc:creator>Tac-Tics</dc:creator>
		<pubDate>Tue, 20 Nov 2007 15:33:53 +0000</pubDate>
		<guid isPermaLink="false">http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/#comment-38</guid>
		<description>I wrote a list comprehension macro the other day. I don&#039;t use CL, but I was reading up on it, and I thought it would be an interesting exercise. But I gave mine a different form:

(zf (* x y)
    (x &#039;(1 2 3 4))
    (y &#039;(1 2 3 4))
    if (evenp x)
       (oddp y))

I used zf for the name, as list comprehensions are sometimes called Zermelo–Fraenkel expressions, and because zf is really short and stands out. The if marker in the middle breaks the sets from the conditions, avoiding the prefix &lt;- form and makes the whole thing slightly easier on the eyes. (Again, I&#039;m not a Lisper, so I don&#039;t have the Paren-Sight yet ;-)

It&#039;s cool to see someone else doing the same thing.</description>
		<content:encoded><![CDATA[<p>I wrote a list comprehension macro the other day. I don&#8217;t use CL, but I was reading up on it, and I thought it would be an interesting exercise. But I gave mine a different form:</p>
<p>(zf (* x y)<br />
    (x &#8216;(1 2 3 4))<br />
    (y &#8216;(1 2 3 4))<br />
    if (evenp x)<br />
       (oddp y))</p>
<p>I used zf for the name, as list comprehensions are sometimes called Zermelo–Fraenkel expressions, and because zf is really short and stands out. The if marker in the middle breaks the sets from the conditions, avoiding the prefix &lt;- form and makes the whole thing slightly easier on the eyes. (Again, I&#8217;m not a Lisper, so I don&#8217;t have the Paren-Sight yet ;-)</p>
<p>It&#8217;s cool to see someone else doing the same thing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Roger Sen</title>
		<link>http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/comment-page-1/#comment-37</link>
		<dc:creator>Roger Sen</dc:creator>
		<pubDate>Tue, 20 Nov 2007 15:32:40 +0000</pubDate>
		<guid isPermaLink="false">http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/#comment-37</guid>
		<description>You&#039;ll find this paper from Guy Lapalme interesting:
 http://rali.iro.umontreal.ca/Publications/urls/LapalmeLispComp.pdf</description>
		<content:encoded><![CDATA[<p>You&#8217;ll find this paper from Guy Lapalme interesting:<br />
 <a href="http://rali.iro.umontreal.ca/Publications/urls/LapalmeLispComp.pdf" rel="nofollow">http://rali.iro.umontreal.ca/Publications/urls/LapalmeLispComp.pdf</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
