<?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 for Off The Lip</title>
	<atom:link href="http://offthelip.org/?feed=comments-rss2" rel="self" type="application/rss+xml" />
	<link>http://offthelip.org</link>
	<description>Code weavings for the surf addicts</description>
	<lastBuildDate>Sat, 12 Jan 2013 08:57:32 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Witty: Implementing an Interpreter in Haskell by johnny-john</title>
		<link>http://offthelip.org/?p=123&#038;cpage=1#comment-67056</link>
		<dc:creator>johnny-john</dc:creator>
		<pubDate>Sat, 12 Jan 2013 08:57:32 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=123#comment-67056</guid>
		<description>Neat! Checking the source code, thank you.</description>
		<content:encoded><![CDATA[<p>Neat! Checking the source code, thank you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Multi-layered Perceptron Trained With Backpropagation (in Scala) by Nicolas</title>
		<link>http://offthelip.org/?p=180&#038;cpage=1#comment-65198</link>
		<dc:creator>Nicolas</dc:creator>
		<pubDate>Thu, 06 Dec 2012 03:04:06 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=180#comment-65198</guid>
		<description>This looks like that other implementation from yannart (https://github.com/yannart/Scala-Neural-Network/blob/master/src/main/scala/com/yannart/neuralnetwork/NeuralNetwork.scala) but yours has a more functional style.

Next, try parallelizing this. The easiest step towards this goal might be to evaluate a layer in parallel.

I would be interested in implementations that use Scala&#039;s actors, where each neuron receives and sends messages. Perhaps Akka.io has some interesting features as well.</description>
		<content:encoded><![CDATA[<p>This looks like that other implementation from yannart (<a href="https://github.com/yannart/Scala-Neural-Network/blob/master/src/main/scala/com/yannart/neuralnetwork/NeuralNetwork.scala" rel="nofollow">https://github.com/yannart/Scala-Neural-Network/blob/master/src/main/scala/com/yannart/neuralnetwork/NeuralNetwork.scala</a>) but yours has a more functional style.</p>
<p>Next, try parallelizing this. The easiest step towards this goal might be to evaluate a layer in parallel.</p>
<p>I would be interested in implementations that use Scala&#8217;s actors, where each neuron receives and sends messages. Perhaps Akka.io has some interesting features as well.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Distributed Hash Tables (part 2) by Jesse Hallett</title>
		<link>http://offthelip.org/?p=157&#038;cpage=1#comment-63972</link>
		<dc:creator>Jesse Hallett</dc:creator>
		<pubDate>Mon, 29 Oct 2012 19:56:43 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=157#comment-63972</guid>
		<description>Thank you for this article!  I feel that I got a good technical overview of Kademlia by reading this article from the bittorrent blog:

http://bittorrent.org/beps/bep_0005.html

But the article here gave me a better understanding of the reasoning behind k-buckets.</description>
		<content:encoded><![CDATA[<p>Thank you for this article!  I feel that I got a good technical overview of Kademlia by reading this article from the bittorrent blog:</p>
<p><a href="http://bittorrent.org/beps/bep_0005.html" rel="nofollow">http://bittorrent.org/beps/bep_0005.html</a></p>
<p>But the article here gave me a better understanding of the reasoning behind k-buckets.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Future Won&#8217;t Be Statically Typed by Matthieu Riou</title>
		<link>http://offthelip.org/?p=47&#038;cpage=1#comment-62896</link>
		<dc:creator>Matthieu Riou</dc:creator>
		<pubDate>Thu, 20 Sep 2012 17:19:25 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/2007/02/16/the-future-wont-be-statically-typed/#comment-62896</guid>
		<description>Yup, in hindsight that post was a little naive. I&#039;m hopefully wiser now :)</description>
		<content:encoded><![CDATA[<p>Yup, in hindsight that post was a little naive. I&#8217;m hopefully wiser now <img src='http://offthelip.org/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Future Won&#8217;t Be Statically Typed by Michael Bailey</title>
		<link>http://offthelip.org/?p=47&#038;cpage=1#comment-62895</link>
		<dc:creator>Michael Bailey</dc:creator>
		<pubDate>Thu, 20 Sep 2012 16:45:05 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/2007/02/16/the-future-wont-be-statically-typed/#comment-62895</guid>
		<description>&quot;...because I’m pretty sure you won’t see much of them 5 years from now.&quot;

It&#039;s five years later.  So much for that prediction.</description>
		<content:encoded><![CDATA[<p>&#8220;&#8230;because I’m pretty sure you won’t see much of them 5 years from now.&#8221;</p>
<p>It&#8217;s five years later.  So much for that prediction.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why Not Haskell? by Alexey Tarasevich</title>
		<link>http://offthelip.org/?p=125&#038;cpage=1#comment-61965</link>
		<dc:creator>Alexey Tarasevich</dc:creator>
		<pubDate>Sun, 05 Aug 2012 09:25:45 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=125#comment-61965</guid>
		<description>I see here 2 unbalanced opinions regarding duplicated names of fields/methods for different data structures. On one side it&#039;s Muri, on other side are people like CD-Host.

To @CD-Host i&#039;d say 1. It&#039;s rude and impolite to say &quot;Muri’s point is frankly silly&quot;. 2. You are missing the point if you don&#039;t see a problem here. Natural language (like English) use same words to refer to different enough phenomenons and concepts. Those concepts may be somewhat related (that&#039;s why they share the name), but still different. Then we naturally borrow those names from English to our program in some PL. We borrow (ambiguous) words from natural language because we need to remember them somehow and we want other human being understand what we&#039;ve written. And then we have a potential conflict. The question is: does the PL provide tools to resolve the conflict gracefully, or does it get in the way. I don&#039;t know Haskell that well, but I see that in this particular case Haskell get in the way. E.g. we might want length of String to return Integer and length of Vehicle to return (Float, Unit) pair. So I don&#039;t see how type classes can easily resolve the problem.

Summarizing: 1) it&#039;s valuable feature of a programming language to borrow ambiguous names from natural language and provide some means to resolve ambiguity 2) Haskell is not that good in this respect as typicall OOP languages.

On the other hand, and that&#039;s what @Muri misses: any language has advantages and disadvantages. In any language you have to work around some limitations. E.g. in C++ you have those duplication between h &amp; cpp files, you have to manually manage memory and so on. And what the article author says is that benefits of Haskell overweight the limitations.</description>
		<content:encoded><![CDATA[<p>I see here 2 unbalanced opinions regarding duplicated names of fields/methods for different data structures. On one side it&#8217;s Muri, on other side are people like CD-Host.</p>
<p>To @CD-Host i&#8217;d say 1. It&#8217;s rude and impolite to say &#8220;Muri’s point is frankly silly&#8221;. 2. You are missing the point if you don&#8217;t see a problem here. Natural language (like English) use same words to refer to different enough phenomenons and concepts. Those concepts may be somewhat related (that&#8217;s why they share the name), but still different. Then we naturally borrow those names from English to our program in some PL. We borrow (ambiguous) words from natural language because we need to remember them somehow and we want other human being understand what we&#8217;ve written. And then we have a potential conflict. The question is: does the PL provide tools to resolve the conflict gracefully, or does it get in the way. I don&#8217;t know Haskell that well, but I see that in this particular case Haskell get in the way. E.g. we might want length of String to return Integer and length of Vehicle to return (Float, Unit) pair. So I don&#8217;t see how type classes can easily resolve the problem.</p>
<p>Summarizing: 1) it&#8217;s valuable feature of a programming language to borrow ambiguous names from natural language and provide some means to resolve ambiguity 2) Haskell is not that good in this respect as typicall OOP languages.</p>
<p>On the other hand, and that&#8217;s what @Muri misses: any language has advantages and disadvantages. In any language you have to work around some limitations. E.g. in C++ you have those duplication between h &amp; cpp files, you have to manually manage memory and so on. And what the article author says is that benefits of Haskell overweight the limitations.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why Not Haskell? by Jeanne-Kamikaze</title>
		<link>http://offthelip.org/?p=125&#038;cpage=1#comment-61816</link>
		<dc:creator>Jeanne-Kamikaze</dc:creator>
		<pubDate>Fri, 27 Jul 2012 16:41:40 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=125#comment-61816</guid>
		<description>@Muri

&quot;I don’t want to make 500 little files in a codebase just because of one ridiculous language flaw.&quot;

However you seem pretty comfortable maintaining duplicate code in .h and .cpp files.</description>
		<content:encoded><![CDATA[<p>@Muri</p>
<p>&#8220;I don’t want to make 500 little files in a codebase just because of one ridiculous language flaw.&#8221;</p>
<p>However you seem pretty comfortable maintaining duplicate code in .h and .cpp files.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Future Won&#8217;t Be Statically Typed by edrowlad</title>
		<link>http://offthelip.org/?p=47&#038;cpage=1#comment-60338</link>
		<dc:creator>edrowlad</dc:creator>
		<pubDate>Thu, 09 Feb 2012 18:15:50 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/2007/02/16/the-future-wont-be-statically-typed/#comment-60338</guid>
		<description>&gt;  Duck Typing is neat, and if done right, just as safe as static typing.

Frequently claimed, but I don&#039;t get it. Somebody adds a new method to an interface. In a statically typed language, you get compile-time error messages indicating the 47 classes that haven&#039;t yet implemented the interface. Duck typing, you run it &#039;till it breaks, possibly never running into a class with a missing member until one of your users finds it in the field. How could this possibly be safer? Somrbody s&#039;plain it to me please.</description>
		<content:encoded><![CDATA[<p>&gt;  Duck Typing is neat, and if done right, just as safe as static typing.</p>
<p>Frequently claimed, but I don&#8217;t get it. Somebody adds a new method to an interface. In a statically typed language, you get compile-time error messages indicating the 47 classes that haven&#8217;t yet implemented the interface. Duck typing, you run it &#8217;till it breaks, possibly never running into a class with a missing member until one of your users finds it in the field. How could this possibly be safer? Somrbody s&#8217;plain it to me please.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tech @ the Zoo by Matthieu Riou</title>
		<link>http://offthelip.org/?p=193&#038;cpage=1#comment-58198</link>
		<dc:creator>Matthieu Riou</dc:creator>
		<pubDate>Fri, 09 Dec 2011 17:04:35 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=193#comment-58198</guid>
		<description>@matt fun stuff but I&#039;m tempted to claim non guilty for the NoSQL readiness. My own personal definition for NoSQL (although I know the dude who spotted the name, we can all invent ours) is storages that are located somewhere else in the CAP triangle than regular ORMs. Usually they give up consistency. Anyway K&amp;F is looking good, keep up the good work!

@antoine thanks man, will try.

@dan good thing when you&#039;re on top of something like mongo is that you tend to abuse the ORM a little less (you&#039;ve basically thrown away the R already). Your point still stands though.</description>
		<content:encoded><![CDATA[<p>@matt fun stuff but I&#8217;m tempted to claim non guilty for the NoSQL readiness. My own personal definition for NoSQL (although I know the dude who spotted the name, we can all invent ours) is storages that are located somewhere else in the CAP triangle than regular ORMs. Usually they give up consistency. Anyway K&#038;F is looking good, keep up the good work!</p>
<p>@antoine thanks man, will try.</p>
<p>@dan good thing when you&#8217;re on top of something like mongo is that you tend to abuse the ORM a little less (you&#8217;ve basically thrown away the R already). Your point still stands though.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Tech @ the Zoo by Dan</title>
		<link>http://offthelip.org/?p=193&#038;cpage=1#comment-58197</link>
		<dc:creator>Dan</dc:creator>
		<pubDate>Fri, 09 Dec 2011 16:24:29 +0000</pubDate>
		<guid isPermaLink="false">http://offthelip.org/?p=193#comment-58197</guid>
		<description>I&#039;m meh on mongoose as well. Looks like poutine is just a nicer version of the same approach, and neither has thought through reflection at all. I&#039;m skeptical that ORM and event loops can ever really play nice since the former are universally memory pigs and the latter hates memory pigs (especially with 32-bit node). I&#039;d really like to see a library which is purely reflective and event-loop friendly (ie streaming) and just pipes data straight through in pieces.</description>
		<content:encoded><![CDATA[<p>I&#8217;m meh on mongoose as well. Looks like poutine is just a nicer version of the same approach, and neither has thought through reflection at all. I&#8217;m skeptical that ORM and event loops can ever really play nice since the former are universally memory pigs and the latter hates memory pigs (especially with 32-bit node). I&#8217;d really like to see a library which is purely reflective and event-loop friendly (ie streaming) and just pipes data straight through in pieces.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
