<?xml version="1.0" encoding="UTF-8"?>

<rss version='2.0' 
     xmlns:creativeCommons="http://backend.userland.com/creativeCommonsRssModule"
     xmlns:doap="http://usefulinc.com/ns/doap#"
     xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">

    <channel>
        <!-- This XML Feed shows details for the page .future 
             and everything recently tagged .future -->
        <creativeCommons:license>http://creativecommons.org/licenses/by-sa/2.5/
          </creativeCommons:license>
        <title>.future on SWiK</title>
		<link>http://swik.net/.future</link>
        <doap:name>.future</doap:name>
        <doap:description></doap:description>
        <description></description> 
	  <!-- see doap:description for full description -->
        <link>http://swik.net/.future</link>
        
        <pubDate></pubDate>
        <lastBuildDate></lastBuildDate>
            
        <item>
            <title>Oliver Steele &quot; Blog Archive &quot; Commit Policies</title>
            <link>http://swik.net/git/del.icio.us+tag%2Fgit/Oliver+Steele+%22+Blog+Archive+%22+Commit+Policies/chsah</link>
            <description>another promising git essay, good looking images</description>
            
            <pubDate>Wed, 15 Oct 2008 14:46:53 -0700</pubDate>
        </item>
            
        <item>
            <title>Lambdacats</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/Lambdacats/cfkc0</link>
            <description>Haskell lolcats.  Yup.</description>
            
            <pubDate>Mon, 22 Sep 2008 20:09:26 -0700</pubDate>
        </item>
            
        <item>
            <title>The Universe of Discourse : data Mu f = In (f (Mu f))</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/The+Universe+of+Discourse+%3A+data+Mu+f+%3D+In+%28f+%28Mu+f%29%29/ce6wn</link>
            <description>Excellent explanation of kinds and fixed points over types in Haskell.</description>
            
            <pubDate>Thu, 18 Sep 2008 20:01:50 -0700</pubDate>
        </item>
            
        <item>
            <title>Knuth-Morris-Pratt in Haskell - 21 thoughts</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/Knuth-Morris-Pratt+in+Haskell+-+21+thoughts/cdlma</link>
            <description>&amp;quot;There exists an algorithm called the Knuth-Morris-Pratt string searching algorithm which has a much better, O(length as + length bs), worst case behavior.&amp;quot;  It&amp;#039;s usually an imperative style algorithm, but this post presents a functional version in Haskell.</description>
            
            <pubDate>Wed, 03 Sep 2008 08:56:55 -0700</pubDate>
        </item>
            
        <item>
            <title>FS: Backwards State, or: The Power of Laziness</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/FS%3A+Backwards+State%2C+or%3A+The+Power+of+Laziness/ccbpl</link>
            <description>&amp;quot;The backwards state monad differs from [the regular state monad] in that the flow of the state through the execution is revere to the flow of the results - that is, an action in the backwards state monad takes in the final value of the state and produces a result and the initial value.&amp;quot;</description>
            
            <pubDate>Tue, 12 Aug 2008 14:04:33 -0700</pubDate>
        </item>
            
        <item>
            <title>Mindfuck: The Reverse State Monad @ The dreams that stuff is made of</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/Mindfuck%3A+The+Reverse+State+Monad+%40+The+dreams+that+stuff+is+made+of/ccbpe</link>
            <description>&amp;quot;Someone in the #haskell IRC channel mentioned the “reverse state monad” explaining that it used the state from the next computation and passed it to the previous one. Well, I just had to try this!&amp;quot;</description>
            
            <pubDate>Tue, 12 Aug 2008 14:04:32 -0700</pubDate>
        </item>
            
        <item>
            <title>Haskell Cafe - A handy little consequence of the Cont monad</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/Haskell+Cafe+-+A+handy+little+consequence+of+the+Cont+monad/cbycn</link>
            <description>(TODO: Grok this.) Cale demonstrates a one-liner that is &amp;quot;generally useful whenever you have a bunch of with-style functions for managing the allocation of resources, and would like to turn them into a single with-style function providing a list of the... </description>
            
            <pubDate>Fri, 08 Aug 2008 09:07:40 -0700</pubDate>
        </item>
            
        <item>
            <title>Selenium</title>
            <link>http://swik.net/opensource/del.icio.us+tag%2Fopensource/Selenium/cae2q</link>
            <description>&amp;quot;Selenium is a test tool for web applications. Selenium tests run directly in a browser, just like real users do. It runs in Internet Explorer, Mozilla and Firefox on Windows, Linux, and Macintosh, Safari on the Mac.&amp;quot;</description>
            
            <pubDate>Tue, 15 Jul 2008 14:51:14 -0700</pubDate>
        </item>
            
        <item>
            <title>Why Why Functional Programming Matters Matters</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/Why+Why+Functional+Programming+Matters+Matters/b5l5k</link>
            <description>&amp;quot;When I first read WhyFP, I thought the author was expressing an opinion about the design of good programming languages. Whereas on the second reading, I realized he was expressing an opinion about the design of good programs.&amp;quot;</description>
            
            <pubDate>Wed, 21 May 2008 12:15:33 -0700</pubDate>
        </item>
            
        <item>
            <title>Mathematical Pamphlet ‽ Debugging with Open Recursion Mixins</title>
            <link>http://swik.net/Haskell/del.icio.us+tag%2Fhaskell/Mathematical+Pamphlet+%E2%80%BD+Debugging+with+Open+Recursion+Mixins/b49ks</link>
            <description>&amp;quot;open-recursive functions already have some debugging hooks for tracing/breakpoints/etc.&amp;quot;</description>
            
            <pubDate>Sat, 17 May 2008 10:14:33 -0700</pubDate>
        </item>
                </channel>
</rss>
