<?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 Less Sugar/More Meat</title>
	<atom:link href="http://netsuperbrain.com/blog/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://netsuperbrain.com/blog</link>
	<description>FRP, Haskell, Reactive, Anygma, and FieldTrip</description>
	<pubDate>Wed, 10 Mar 2010 15:00:36 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>Comment on Best Haskell Papers of 2009 by Rohan Hart</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-14060</link>
		<dc:creator>Rohan Hart</dc:creator>
		<pubDate>Wed, 10 Feb 2010 20:59:52 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-14060</guid>
		<description>&lt;p&gt;Finally Tagless, Partially Evaluated is great, but was first published in 2007 (http://okmij.org/ftp/Computation/tagless-typed.html#tagless-final  I've not checked to see whether there are any significant differences between the APLAS and JFP versions&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Finally Tagless, Partially Evaluated is great, but was first published in 2007 (http://okmij.org/ftp/Computation/tagless-typed.html#tagless-final  I&#8217;ve not checked to see whether there are any significant differences between the APLAS and JFP versions</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Best Haskell Papers of 2009 by Linktipps Februar 2010 :: Blackflash</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-13827</link>
		<dc:creator>Linktipps Februar 2010 :: Blackflash</dc:creator>
		<pubDate>Wed, 27 Jan 2010 15:53:59 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-13827</guid>
		<description>&lt;p&gt;&#60;&lt;/p&gt;

&lt;p&gt;p&gt;[...] die Problematik von NOSQL vs. SQL beleuchtet. Vor allem das Fazit sollte man sich zu Herzen nehmen.Best Haskell Papers of 2009: Eine zugegebenerma&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>&lt;</p>

<p>p>[...] die Problematik von NOSQL vs. SQL beleuchtet. Vor allem das Fazit sollte man sich zu Herzen nehmen.Best Haskell Papers of 2009: Eine zugegebenerma</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Best Haskell Papers of 2009 by David Sankel</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-13811</link>
		<dc:creator>David Sankel</dc:creator>
		<pubDate>Tue, 26 Jan 2010 15:47:05 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-13811</guid>
		<description>&lt;p&gt;@solrize: Thanks for that pointer. I'm looking forward to giving that thesis a read.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>@solrize: Thanks for that pointer. I&#8217;m looking forward to giving that thesis a read.</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Best Haskell Papers of 2009 by solrize</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-13805</link>
		<dc:creator>solrize</dc:creator>
		<pubDate>Tue, 26 Jan 2010 09:00:25 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-13805</guid>
		<description>&lt;p&gt;I should also have said, the rest of the Haskell literature doesn't discuss type-and-effect systems very much so I basically didn't know anything about them.  But Disciple is based on one and the thesis is explaining it pretty well so far, so I'm learning a lot.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>I should also have said, the rest of the Haskell literature doesn&#8217;t discuss type-and-effect systems very much so I basically didn&#8217;t know anything about them.  But Disciple is based on one and the thesis is explaining it pretty well so far, so I&#8217;m learning a lot.</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Best Haskell Papers of 2009 by solrize</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-13804</link>
		<dc:creator>solrize</dc:creator>
		<pubDate>Tue, 26 Jan 2010 08:57:34 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-13804</guid>
		<description>&lt;p&gt;I think Ben Lippmeier's PhD thesis about Disciple should be included.  Its first chapter is one of the most clearheaded criticisms of Haskell that I've seen.  The rest is about how to fix it.  I'm in chapter 2 now.&lt;/p&gt;

&lt;p&gt;Reference:
  Type Inference and Optimisation for an Impure World
  Ben Lippmeier
  PhD Thesis, Australian National University, Submitted June 2009. 
  http://cs.anu.edu.au/people/Ben.Lippmeier/project/thesis/thesis-lippmeier-sub.pdf&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>I think Ben Lippmeier&#8217;s PhD thesis about Disciple should be included.  Its first chapter is one of the most clearheaded criticisms of Haskell that I&#8217;ve seen.  The rest is about how to fix it.  I&#8217;m in chapter 2 now.</p>

<p>Reference:
  Type Inference and Optimisation for an Impure World
  Ben Lippmeier
  PhD Thesis, Australian National University, Submitted June 2009. 
  <a href="http://cs.anu.edu.au/people/Ben.Lippmeier/project/thesis/thesis-lippmeier-sub.pdf" rel="nofollow">http://cs.anu.edu.au/people/Ben.Lippmeier/project/thesis/thesis-lippmeier-sub.pdf</a></p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Semantic Editor Combinators - one of my favorite blog posts by David Sankel</title>
		<link>http://netsuperbrain.com/blog/posts/semantic-editor-combiners/#comment-13725</link>
		<dc:creator>David Sankel</dc:creator>
		<pubDate>Tue, 19 Jan 2010 16:17:55 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=363#comment-13725</guid>
		<description>&lt;p&gt;@Conal: Thanks for pointing out my mistake. I've made the fix.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>@Conal: Thanks for pointing out my mistake. I&#8217;ve made the fix.</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Best Haskell Papers of 2009 by Arthur</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-13719</link>
		<dc:creator>Arthur</dc:creator>
		<pubDate>Tue, 19 Jan 2010 08:23:46 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-13719</guid>
		<description>&lt;p&gt;The first link (the paper) was an awfully fun read...&lt;/p&gt;

&lt;p&gt;"With the above criteria in mind, we looked at some of the more pop- ular free functional language implementations available. Our abil- ity to compare these was limited: we simply didn’t know enough about functional languages in general, and had no extensive experi- ence with any functional language implementation."&lt;/p&gt;

&lt;p&gt;I've tried to build multi-month small scale projects in Scala, OCaml and Haskell.  My experience with Scala was that it was simply too verbose.  I tried doing a web-app in Java, and found it maddeningly verbose.  Scala was an improvement (compared to Java), but the Eclipse plugin wasn't very mature and the syntax was still too verbose.  I didn't get too far with Scala because I felt that I was simply wasting too much time typing.  If I were stuck on the JVM, it'd be a solid option, but then there's Clojure.&lt;/p&gt;

&lt;p&gt;OCaml was pretty powerful but ultimately too baroque.  I spent nearly a year and a half trying to write a purely functional CAD program in it before giving up and using the OO component of the language.  The OO system turned out to be clean, well thought out and aptly suited for conventional application programming, but no one wants to team up and write an staid old platform app these days.&lt;/p&gt;

&lt;p&gt;Academic debates about type systems aside, Haskell's typeclasses are more powerful than the ML system's functors.  Writing explicitly tail-recursive functions was also a pain.  I think OCaml's day may yet still come, if we'd be able to get it working on a mobile platform, because it's (IMO) the best statically-typed hybrid functional/OO language out there.&lt;/p&gt;

&lt;p&gt;My current preference right now is towards Haskell.  The library support is fantastic, laziness is darn awful handy (space leaks be damned), and I can actually find other hackers doing stuff with the language (who helped me quite a bit when I was starting out).  Sure, it took about a month to pick it up despite having done ML beforehand, but that's a small price to pay for the joy of having a community, and of writing code with a plethora of pre-written toys (e.g. applicative functors, libraries for SMTP, the kitchen sink).&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>The first link (the paper) was an awfully fun read&#8230;</p>

<p>&#8220;With the above criteria in mind, we looked at some of the more pop- ular free functional language implementations available. Our abil- ity to compare these was limited: we simply didn’t know enough about functional languages in general, and had no extensive experi- ence with any functional language implementation.&#8221;</p>

<p>I&#8217;ve tried to build multi-month small scale projects in Scala, OCaml and Haskell.  My experience with Scala was that it was simply too verbose.  I tried doing a web-app in Java, and found it maddeningly verbose.  Scala was an improvement (compared to Java), but the Eclipse plugin wasn&#8217;t very mature and the syntax was still too verbose.  I didn&#8217;t get too far with Scala because I felt that I was simply wasting too much time typing.  If I were stuck on the JVM, it&#8217;d be a solid option, but then there&#8217;s Clojure.</p>

<p>OCaml was pretty powerful but ultimately too baroque.  I spent nearly a year and a half trying to write a purely functional CAD program in it before giving up and using the OO component of the language.  The OO system turned out to be clean, well thought out and aptly suited for conventional application programming, but no one wants to team up and write an staid old platform app these days.</p>

<p>Academic debates about type systems aside, Haskell&#8217;s typeclasses are more powerful than the ML system&#8217;s functors.  Writing explicitly tail-recursive functions was also a pain.  I think OCaml&#8217;s day may yet still come, if we&#8217;d be able to get it working on a mobile platform, because it&#8217;s (IMO) the best statically-typed hybrid functional/OO language out there.</p>

<p>My current preference right now is towards Haskell.  The library support is fantastic, laziness is darn awful handy (space leaks be damned), and I can actually find other hackers doing stuff with the language (who helped me quite a bit when I was starting out).  Sure, it took about a month to pick it up despite having done ML beforehand, but that&#8217;s a small price to pay for the joy of having a community, and of writing code with a plethora of pre-written toys (e.g. applicative functors, libraries for SMTP, the kitchen sink).</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Semantic Editor Combinators - one of my favorite blog posts by Conal Elliott</title>
		<link>http://netsuperbrain.com/blog/posts/semantic-editor-combiners/#comment-13717</link>
		<dc:creator>Conal Elliott</dc:creator>
		<pubDate>Tue, 19 Jan 2010 06:40:25 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=363#comment-13717</guid>
		<description>&lt;p&gt;Hi David.  Thanks for the plug!  I'm glad you like the post.&lt;/p&gt;

&lt;p&gt;Would you do me a favor and fix the title to be "Semantic Editor Combinators"?  (Note "combinator" rather than "combiner".)  The building blocks are combinators (higher-order functions, or more generally purely functional library elements) and more specifically lifters, but mainly not combiners of editors.  I like to stem nomenclature confusions before they spread much.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Hi David.  Thanks for the plug!  I&#8217;m glad you like the post.</p>

<p>Would you do me a favor and fix the title to be &#8220;Semantic Editor Combinators&#8221;?  (Note &#8220;combinator&#8221; rather than &#8220;combiner&#8221;.)  The building blocks are combinators (higher-order functions, or more generally purely functional library elements) and more specifically lifters, but mainly not combiners of editors.  I like to stem nomenclature confusions before they spread much.</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Semantic Editor Combinators - one of my favorite blog posts by Less Sugar/More Meat &#187; Blog Archive &#187; Best Haskell Papers of 2009</title>
		<link>http://netsuperbrain.com/blog/posts/semantic-editor-combiners/#comment-13714</link>
		<dc:creator>Less Sugar/More Meat &#187; Blog Archive &#187; Best Haskell Papers of 2009</dc:creator>
		<pubDate>Tue, 19 Jan 2010 02:58:25 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=363#comment-13714</guid>
		<description>&lt;p&gt;[...] a short note on a blog post that I really wanted to be on this list.  January 18th, 2010 in [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] a short note on a blog post that I really wanted to be on this list.  January 18th, 2010 in [...]</p>]]></content:encoded>
	</item>
	<item>
		<title>Comment on Best Haskell Papers of 2009 by Less Sugar/More Meat &#187; Blog Archive &#187; Semantic Editor Combiners - one of my favorite blog posts</title>
		<link>http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/#comment-13713</link>
		<dc:creator>Less Sugar/More Meat &#187; Blog Archive &#187; Semantic Editor Combiners - one of my favorite blog posts</dc:creator>
		<pubDate>Tue, 19 Jan 2010 02:54:28 +0000</pubDate>
		<guid isPermaLink="false">http://netsuperbrain.com/blog/?p=318#comment-13713</guid>
		<description>&lt;p&gt;[...] wanted to squeeze this blog post into my Best Haskell Papers of 2009 article, but it unfortunately was written in late 2008. For your enjoyment, here is the entry [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] wanted to squeeze this blog post into my Best Haskell Papers of 2009 article, but it unfortunately was written in late 2008. For your enjoyment, here is the entry [...]</p>]]></content:encoded>
	</item>
</channel>
</rss>
