<?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"
	>
<channel>
	<title>Comments for Jonathan's Techno-tales</title>
	<atom:link href="http://technotales.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://technotales.wordpress.com</link>
	<description>no magic - just tricks</description>
	<pubDate>Sun, 06 Jul 2008 16:19:50 +0000</pubDate>
	<generator>http://wordpress.org/?v=MU</generator>
		<item>
		<title>Comment on Like Slime, for Vim by Mikael Jansson</title>
		<link>http://technotales.wordpress.com/2007/10/03/like-slime-for-vim/#comment-184</link>
		<dc:creator>Mikael Jansson</dc:creator>
		<pubDate>Sun, 08 Jun 2008 21:10:27 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/2007/10/03/like-slime-for-vim/#comment-184</guid>
		<description>Hey all,

If you only want to code Lisp in Vim, I'd advice you to have a look at my plugin, Limp, which does this and then some more.

It's available at http://mikael.jansson.be/hacking/limp -- I hope you find it useful!  I'm always open for suggestions.

Thanks!
-- Mikael</description>
		<content:encoded><![CDATA[<p>Hey all,</p>
<p>If you only want to code Lisp in Vim, I&#8217;d advice you to have a look at my plugin, Limp, which does this and then some more.</p>
<p>It&#8217;s available at <a href="http://mikael.jansson.be/hacking/limp" rel="nofollow">http://mikael.jansson.be/hacking/limp</a> &#8212; I hope you find it useful!  I&#8217;m always open for suggestions.</p>
<p>Thanks!<br />
&#8211; Mikael</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Like Slime, for Vim by 理解痛苦，即是快乐 &#187; VIM &#38; Lisp &#38; Screen配合使用</title>
		<link>http://technotales.wordpress.com/2007/10/03/like-slime-for-vim/#comment-183</link>
		<dc:creator>理解痛苦，即是快乐 &#187; VIM &#38; Lisp &#38; Screen配合使用</dc:creator>
		<pubDate>Fri, 23 May 2008 23:26:59 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/2007/10/03/like-slime-for-vim/#comment-183</guid>
		<description>[...] Like Slime, for Vim Scripting screen for fun and [...]</description>
		<content:encoded><![CDATA[<p>[...] Like Slime, for Vim Scripting screen for fun and [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Code Syntax Highlighting for Blogs with VIM by fun with mochiweb&#8217;s html parser and xpath &#171; ppolv&#8217;s blog</title>
		<link>http://technotales.wordpress.com/2007/08/11/code-syntax-highlighting-for-blogs-with-vim/#comment-180</link>
		<dc:creator>fun with mochiweb&#8217;s html parser and xpath &#171; ppolv&#8217;s blog</dc:creator>
		<pubDate>Fri, 09 May 2008 23:08:28 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/2007/08/11/code-syntax-highlighting-for-blogs-with-vim/#comment-180</guid>
		<description>[...] p.s. it looks like I finally learn how to easily embed erlang code in wordpress!, taking some ideas from code-syntax-highlighting-for-blogs-with-vim [...]</description>
		<content:encoded><![CDATA[<p>[...] p.s. it looks like I finally learn how to easily embed erlang code in wordpress!, taking some ideas from code-syntax-highlighting-for-blogs-with-vim [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Like Slime, for Vim by Courtney</title>
		<link>http://technotales.wordpress.com/2007/10/03/like-slime-for-vim/#comment-179</link>
		<dc:creator>Courtney</dc:creator>
		<pubDate>Fri, 09 May 2008 07:35:48 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/2007/10/03/like-slime-for-vim/#comment-179</guid>
		<description>Sick,
I have been looking something like this for this for a while!

Thanks,
Courtney</description>
		<content:encoded><![CDATA[<p>Sick,<br />
I have been looking something like this for this for a while!</p>
<p>Thanks,<br />
Courtney</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Code Syntax Highlighting for Blogs with VIM by bpp</title>
		<link>http://technotales.wordpress.com/2007/08/11/code-syntax-highlighting-for-blogs-with-vim/#comment-178</link>
		<dc:creator>bpp</dc:creator>
		<pubDate>Tue, 29 Apr 2008 05:04:24 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/2007/08/11/code-syntax-highlighting-for-blogs-with-vim/#comment-178</guid>
		<description>Thank you very much, this is the thing I've been looking for. Just ideal solution!</description>
		<content:encoded><![CDATA[<p>Thank you very much, this is the thing I&#8217;ve been looking for. Just ideal solution!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Rapid Language Tour by Jonathan Palardy</title>
		<link>http://technotales.wordpress.com/2008/04/25/a-rapid-language-tour/#comment-177</link>
		<dc:creator>Jonathan Palardy</dc:creator>
		<pubDate>Sat, 26 Apr 2008 00:56:10 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/?p=59#comment-177</guid>
		<description>wrt Smalltalk:

Tower of Hanoi, as far as I understand its performance, is IO bound. In Smalltalk, I guess I could output to the Transcript which is terribly slow (their own words!). My interest in Smalltalk is purely non-performance related … although it has been claimed faster than Ruby in most cases. We'll see how that goes.

wrt Haskell.

Thanks! I googled for "haskell performance" last night after I posted this. There are a number of tips and tricks out there. I had not been looking to make this really fast. In fact, I could have adopted a more imperative style to make it faster and forego the list creation completely … but that wouldn't be very Haskell-ish.</description>
		<content:encoded><![CDATA[<p>wrt Smalltalk:</p>
<p>Tower of Hanoi, as far as I understand its performance, is IO bound. In Smalltalk, I guess I could output to the Transcript which is terribly slow (their own words!). My interest in Smalltalk is purely non-performance related … although it has been claimed faster than Ruby in most cases. We&#8217;ll see how that goes.</p>
<p>wrt Haskell.</p>
<p>Thanks! I googled for &#8220;haskell performance&#8221; last night after I posted this. There are a number of tips and tricks out there. I had not been looking to make this really fast. In fact, I could have adopted a more imperative style to make it faster and forego the list creation completely … but that wouldn&#8217;t be very Haskell-ish.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Rapid Language Tour by Don Stewart</title>
		<link>http://technotales.wordpress.com/2008/04/25/a-rapid-language-tour/#comment-176</link>
		<dc:creator>Don Stewart</dc:creator>
		<pubDate>Fri, 25 Apr 2008 16:21:05 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/?p=59#comment-176</guid>
		<description>My guess is you didn't compile the Haskell code, but instead ran it in an interpreter like Hugs or GHCi.

This slight refactor:

    import System.Environment

    showMove src dst = putStrLn (show src ++ " -&#62; " ++ show dst)

    data T = One &#124; Two &#124; Three
        deriving Show

    hanoi :: Int -&#62; T -&#62; T -&#62; T -&#62; [(T, T)]
    hanoi 1 src dst acc = [(src, dst)]
    hanoi n src dst acc = hanoi (n-1) src acc dst ++
                          hanoi 1 src dst acc ++
                          hanoi (n-1) acc dst src

    main = do
        args &#60;- getArgs
        let n = read (head args)
        mapM_ (uncurry showMove) (hanoi (n :: Int) One Two Three)

Runs in 10seconds on my box, when compiled:

   ghc -O2 A.hs 

Note its extrememly naive -- you could for a start replace (++) on lists by an O(1) append operation.</description>
		<content:encoded><![CDATA[<p>My guess is you didn&#8217;t compile the Haskell code, but instead ran it in an interpreter like Hugs or GHCi.</p>
<p>This slight refactor:</p>
<p>    import System.Environment</p>
<p>    showMove src dst = putStrLn (show src ++ &#8221; -&gt; &#8221; ++ show dst)</p>
<p>    data T = One | Two | Three<br />
        deriving Show</p>
<p>    hanoi :: Int -&gt; T -&gt; T -&gt; T -&gt; [(T, T)]<br />
    hanoi 1 src dst acc = [(src, dst)]<br />
    hanoi n src dst acc = hanoi (n-1) src acc dst ++<br />
                          hanoi 1 src dst acc ++<br />
                          hanoi (n-1) acc dst src</p>
<p>    main = do<br />
        args &lt;- getArgs<br />
        let n = read (head args)<br />
        mapM_ (uncurry showMove) (hanoi (n :: Int) One Two Three)</p>
<p>Runs in 10seconds on my box, when compiled:</p>
<p>   ghc -O2 A.hs </p>
<p>Note its extrememly naive &#8212; you could for a start replace (++) on lists by an O(1) append operation.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Rapid Language Tour by macournoyer</title>
		<link>http://technotales.wordpress.com/2008/04/25/a-rapid-language-tour/#comment-175</link>
		<dc:creator>macournoyer</dc:creator>
		<pubDate>Fri, 25 Apr 2008 15:17:56 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/?p=59#comment-175</guid>
		<description>How was Smalltalk perf?

I'm surprised about Haskell. Looking at http://shootout.alioth.debian.org/ it seems to perform quite well.

Also Lua and Io look very interesting too.

Nice post!</description>
		<content:encoded><![CDATA[<p>How was Smalltalk perf?</p>
<p>I&#8217;m surprised about Haskell. Looking at <a href="http://shootout.alioth.debian.org/" rel="nofollow">http://shootout.alioth.debian.org/</a> it seems to perform quite well.</p>
<p>Also Lua and Io look very interesting too.</p>
<p>Nice post!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Rapid Language Tour by Jonathan Palardy</title>
		<link>http://technotales.wordpress.com/2008/04/25/a-rapid-language-tour/#comment-174</link>
		<dc:creator>Jonathan Palardy</dc:creator>
		<pubDate>Fri, 25 Apr 2008 14:25:28 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/?p=59#comment-174</guid>
		<description>Good question :)

I make no claim at expertise in Haskell, and here's what I had come up with: http://s3.amazonaws.com/mps/hanoi.hs

You can compare that with http://www.kernelthread.com/hanoi/html/hs.html which generates the whole list in memory (lazily, of course) and outputs it. Keep in mind that 20 rings represents 2^20 lines of output.

Haskell is a fun language with a lot of will-hurt-your-brain ideas … I don't want to make it sound like this is representative of anything.</description>
		<content:encoded><![CDATA[<p>Good question <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>I make no claim at expertise in Haskell, and here&#8217;s what I had come up with: <a href="http://s3.amazonaws.com/mps/hanoi.hs" rel="nofollow">http://s3.amazonaws.com/mps/hanoi.hs</a></p>
<p>You can compare that with <a href="http://www.kernelthread.com/hanoi/html/hs.html" rel="nofollow">http://www.kernelthread.com/hanoi/html/hs.html</a> which generates the whole list in memory (lazily, of course) and outputs it. Keep in mind that 20 rings represents 2^20 lines of output.</p>
<p>Haskell is a fun language with a lot of will-hurt-your-brain ideas … I don&#8217;t want to make it sound like this is representative of anything.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Rapid Language Tour by Gary Haran</title>
		<link>http://technotales.wordpress.com/2008/04/25/a-rapid-language-tour/#comment-173</link>
		<dc:creator>Gary Haran</dc:creator>
		<pubDate>Fri, 25 Apr 2008 13:46:28 +0000</pubDate>
		<guid isPermaLink="false">http://technotales.wordpress.com/?p=59#comment-173</guid>
		<description>Why was Haskell taking that long?</description>
		<content:encoded><![CDATA[<p>Why was Haskell taking that long?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
