<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/css" href="/stylesheets/rss.css"?>
<rss version="2.0" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>Random Hacks comments</title>
    <link>http://www.randomhacks.net/</link>
    <language>en-us</language>
    <ttl>40</ttl>
    <description>Technology and Other Fun Stuff</description>
    <item>
      <title>"Screencast: Use Rails and RDF.rb to parse Best Buy product reviews" by Gregg Kellogg</title>
      <description>&lt;p&gt;Great demo Eric! For another take on parsing Best Buy data, use http://rdf.greggkellogg.net/distiller (source available on GitHub as rdf-portal), also using the &lt;span class="caps"&gt;RDF&lt;/span&gt;.rb gems, to generate &lt;span class="caps"&gt;HTML&lt;/span&gt;+RDFa (or any other serialization) marked up with the same information as the search requests.&lt;/p&gt;


	&lt;p&gt;Also, we do have &lt;span class="caps"&gt;SPARQL&lt;/span&gt; support, but not in the released versions yet. Check out http://github.org/gkellogg/sparql-grammar, which uses the 0.4.x tag of &lt;span class="caps"&gt;RDF&lt;/span&gt;.rb to provide full &lt;span class="caps"&gt;SPARQL 1&lt;/span&gt;.0 support natively in Ruby.&lt;/p&gt;


	&lt;p&gt;Thanks for the great work and helping to show what a great environment for working with &lt;span class="caps"&gt;RDF &lt;/span&gt;Ruby really is.&lt;/p&gt;


	&lt;p&gt;Gregg&lt;/p&gt;</description>
      <pubDate>Wed, 08 Jun 2011 17:24:18 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:dda31477-ac22-41f3-a504-8e6d890a36de</guid>
      <link>http://www.randomhacks.net/articles/2011/06/05/screencast-rails-rdf-agraph-product-reviews#comment-856</link>
    </item>
    <item>
      <title>"Derivatives of algebraic data structures: An excellent tutorial" by Frank Atanassow</title>
      <description>&lt;p&gt;@Eric I beg to differ. The article starts, &amp;#8220;With the spreading popularity of languages like F# and Haskell, many people are encountering the concept of an algebraic data type for the first time.  When that term is produced without explanation, it almost invariably becomes a source of confusion.  In what sense are data types algebraic?&amp;#8221;&lt;/p&gt;


	&lt;p&gt;So whereas they claim to explain in what sense an adt is algebraic, what they end up explaining is in what sense the kind * is algebraic.&lt;/p&gt;</description>
      <pubDate>Tue, 24 May 2011 20:30:41 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:315bc7f5-70f3-44f0-b350-3e2b12d3bc44</guid>
      <link>http://www.randomhacks.net/articles/2011/05/20/derivatives-of-algebraic-data-structures-an-excellent-tutorial#comment-843</link>
    </item>
    <item>
      <title>"Derivatives of algebraic data structures: An excellent tutorial" by Eric</title>
      <description>&lt;p&gt;Aleksey, Steve: Thank you! I fixed the link.&lt;/p&gt;


	&lt;p&gt;Frank: Surely, among consenting category theorists, all isomorphic objects are  identical. ;-) Thank you for the correction.&lt;/p&gt;


	&lt;p&gt;The article isn&amp;#8217;t trying to explain algebraic data types by an analogy to differention. Rather, it&amp;#8217;s trying to explain type differentiation, and it needs to define a loose algebra of types to get there.&lt;/p&gt;</description>
      <pubDate>Mon, 23 May 2011 13:04:02 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:bff740aa-3380-48aa-86aa-5fe377809c4c</guid>
      <link>http://www.randomhacks.net/articles/2011/05/20/derivatives-of-algebraic-data-structures-an-excellent-tutorial#comment-841</link>
    </item>
    <item>
      <title>"Derivatives of algebraic data structures: An excellent tutorial" by Steve Massey</title>
      <description>&lt;p&gt;This is the same paper:&lt;/p&gt;


	&lt;p&gt;http://strictlypositive.org/Dissect.pdf&lt;/p&gt;</description>
      <pubDate>Sun, 22 May 2011 10:42:48 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:befc75bf-b0d4-444c-a5b2-b363276f6562</guid>
      <link>http://www.randomhacks.net/articles/2011/05/20/derivatives-of-algebraic-data-structures-an-excellent-tutorial#comment-840</link>
    </item>
    <item>
      <title>"Derivatives of algebraic data structures: An excellent tutorial" by Aleksey Khudyakov</title>
      <description>&lt;p&gt;This link leads to 403 page. Is this paper available anywhere else?&lt;/p&gt;


	&lt;p&gt;http://www.cs.nott.ac.uk/~ctm/Dissect.pdf&lt;/p&gt;</description>
      <pubDate>Sat, 21 May 2011 14:08:02 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:f4105c04-9a23-4018-b76b-5fea2a4e80f2</guid>
      <link>http://www.randomhacks.net/articles/2011/05/20/derivatives-of-algebraic-data-structures-an-excellent-tutorial#comment-839</link>
    </item>
    <item>
      <title>"Derivatives of algebraic data structures: An excellent tutorial" by Frank Atanassow</title>
      <description>&lt;p&gt;I only read the first half, and it looks like a nice tutorial, but it does not explain what it claims to explain, namely in what sense adt&amp;#8217;s are algebraic.&lt;/p&gt;


	&lt;p&gt;Algebraic datatypes are not called algebraic because type constructors form an algebra, but rather because data constructors do. In fact, type constructors do not even form an algebra; they form a pseudo-algebra, which is a generalization of algebras. That is why properties like associativity of products only hold up to (unique, natural) isomorphism rather than up to type equality.&lt;/p&gt;


	&lt;p&gt;If you want to explain the algebraic nature of Haskell datatypes with an allusion to differentiation, you can do it by defining a datatype, say, of polynomials.&lt;/p&gt;</description>
      <pubDate>Fri, 20 May 2011 23:47:27 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:f84ba62e-37d3-43fb-85d9-92139044456b</guid>
      <link>http://www.randomhacks.net/articles/2011/05/20/derivatives-of-algebraic-data-structures-an-excellent-tutorial#comment-837</link>
    </item>
    <item>
      <title>"What do these fixed points have in common?" by Eric</title>
      <description>&lt;p&gt;Thank you for the pointer! I&amp;#8217;ll try to dig up those papers when I have time to play with this stuff a bit.&lt;/p&gt;


	&lt;p&gt;Some related links of interest:&lt;/p&gt;


	&lt;p&gt;1. The Wikipedia article on &lt;a href="http://en.wikipedia.org/wiki/Fixed_point_theorem" rel="nofollow"&gt;fixed-point theorems&lt;/a&gt;.&lt;/p&gt;


	&lt;p&gt;2. A MathOverflow question about the &lt;a href="http://mathoverflow.net/questions/34511/banach-and-knaster-tarski-fixed-point-theorems-are-they-related" rel="nofollow"&gt;relation between two of the big fixed-point theorems&lt;/a&gt;.&lt;/p&gt;


	&lt;p&gt;Nash equilibria can apparently be &lt;a href="http://en.wikipedia.org/wiki/Nash_equilibrium#Alternate_proof_using_the_Brouwer_fixed_point_theorem" rel="nofollow"&gt;derived from Brouwer fixed points&lt;/a&gt;, according to Wikipedia, but I haven&amp;#8217;t read the proof yet.&lt;/p&gt;</description>
      <pubDate>Thu, 12 May 2011 17:24:18 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:ef259692-efde-4cbe-aa05-bbb9ed9cffee</guid>
      <link>http://www.randomhacks.net/articles/2011/05/12/what-do-fixed-points-have-in-common#comment-834</link>
    </item>
    <item>
      <title>"What do these fixed points have in common?" by Derek Elkins</title>
      <description>&lt;p&gt;There&amp;#8217;s a &amp;#8220;small&amp;#8221; (categorical) diagram that is rarely talked about that is relevant here.  The popular examples are empty diagrams, finite diagrams of discrete points, parallel pairs of arrows, and wedges.  The colimits of those are, respectively, initial objects, coproducts, coequalizers, and pushouts.  There is another notable diagram however, the loop.  Barry Jay has a couple of papers on the limits and colimits of a diagram of this form.  I don&amp;#8217;t know if this will capture all of these examples (in particular, the Nash equilibria would take a bit of twisting I&amp;#8217;d think), but it certainly is a place to start.&lt;/p&gt;</description>
      <pubDate>Thu, 12 May 2011 17:02:07 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:b9c4d16d-54a0-4144-819b-18ab22b2744d</guid>
      <link>http://www.randomhacks.net/articles/2011/05/12/what-do-fixed-points-have-in-common#comment-833</link>
    </item>
    <item>
      <title>"AWS outage timeline &amp; downtimes by recovery strategy" by Eric</title>
      <description>&lt;p&gt;The links should be fixed. Thanks, linkchecker!&lt;/p&gt;</description>
      <pubDate>Mon, 25 Apr 2011 19:44:49 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:a551bba6-cd2b-40bf-8e8b-9f4703b22ccf</guid>
      <link>http://www.randomhacks.net/articles/2011/04/25/aws-outage-timeline-and-recovery-strategy-downtimes#comment-818</link>
    </item>
    <item>
      <title>"AWS outage timeline &amp; downtimes by recovery strategy" by linkchecker</title>
      <description>&lt;p&gt;Under &amp;#8220;Lessons Learned&amp;#8221;, #3, both links point to the reddit blog. Presumably one should point to Netflix instead.&lt;/p&gt;</description>
      <pubDate>Mon, 25 Apr 2011 16:56:45 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:b3348deb-8a96-4c8c-8210-c938d0c59070</guid>
      <link>http://www.randomhacks.net/articles/2011/04/25/aws-outage-timeline-and-recovery-strategy-downtimes#comment-817</link>
    </item>
  </channel>
</rss>
