<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/css" href="/www/stylesheets/rss.css"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/">
  <channel>
    <title>alpheccar's blog - tag algebra</title>
    <link>http://www.alpheccar.org</link>
    <language>en</language>
    <ttl>40</ttl>
    <description>science and freedom</description>
    <image>
      <link>http://www.alpheccar.org</link>
      <title>alpheccar's blog - tag algebra</title>
      <url>http://www.alpheccar.org/images/avatar.jpg</url>
    </image>
    <item>
      <title>Category Theory and Haskell 3 : Algebras and Monads</title>
      <description>
        <![CDATA[<p>This is the third part of my serie about Haskell and category theory. In the previous post, I described a bit the Hask category and some categorical constructs.
The goal of this text is to understand
the meaning of a recursive type like List. For that, we will have to understand what is a free algebra and have a quick look at the relationship with
monads (for applications look at the blog of sigfpe). 
But first, I would like to highlight a problem with the category Hask.</p> <p><a href="http://www.alpheccar.org/en/posts/show/77">Read More...</a></p>
]]>
      </description>
      <pubDate>Mon, 02 Jul 2007 13:52:59 -0500</pubDate>
      <guid isPermaLink="false">urn:uuid:72</guid>
      <author>webmaster@alpheccar.org</author>
      <link>http://www.alpheccar.org/en/posts/show/77</link>
      <comments>http://www.alpheccar.org/en/posts/show/77#comments</comments>
      <category>category theory</category>
      <category>haskell</category>
      <category>maths</category>
      <category>algebra</category>
      <category>monad</category>
    </item>
  </channel>
</rss>
