<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Babu Srinivasan's blog &#187; haskell</title>
	<atom:link href="http://blog.srinivasan.biz/category/software/haskell/feed" rel="self" type="application/rss+xml" />
	<link>http://blog.srinivasan.biz</link>
	<description>Random musings</description>
	<lastBuildDate>Sat, 14 Jan 2012 07:06:47 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Haskell for teaching algorithms</title>
		<link>http://blog.srinivasan.biz/software/haskell-for-teaching-algorithms</link>
		<comments>http://blog.srinivasan.biz/software/haskell-for-teaching-algorithms#comments</comments>
		<pubDate>Sat, 12 Feb 2011 00:23:04 +0000</pubDate>
		<dc:creator>Babu Srinivasan</dc:creator>
				<category><![CDATA[haskell]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[crypto]]></category>

		<guid isPermaLink="false">http://blog.srinivasan.biz/?p=1018</guid>
		<description><![CDATA[<strong>Note 1:</strong>
    This article is executable code. You can copy and paste this article in a file with extension .lhs (say crypto.lhs), load it in a haskell interpreter and run the examples! You can get started by installing the <a href="http://hackage.haskell.org/platform/">haskell platform</a> on Windows, Linux or Mac. You can learn Haskell by reading the excellent tutorial  <a href="http://blog.srinivasan.biz/software/haskell-for-teaching-algorithms" class="read_more">... read more</a>]]></description>
		<wfw:commentRss>http://blog.srinivasan.biz/software/haskell-for-teaching-algorithms/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>hlint : your friendly code critic and adviser</title>
		<link>http://blog.srinivasan.biz/software/hlint-your-friendly-code-critic-and-adviser</link>
		<comments>http://blog.srinivasan.biz/software/hlint-your-friendly-code-critic-and-adviser#comments</comments>
		<pubDate>Sun, 10 Jan 2010 16:05:41 +0000</pubDate>
		<dc:creator>Babu Srinivasan</dc:creator>
				<category><![CDATA[haskell]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://blog.srinivasan.biz/?p=530</guid>
		<description><![CDATA[When learning a programming language, won&#8217;t it be nice if you can get some instant feedback on your code? Of course, you cannot expect feedback on bugs in your program. But each language has some built in functionality and idioms which a beginner may not be aware of and it will be helpful to get  <a href="http://blog.srinivasan.biz/software/hlint-your-friendly-code-critic-and-adviser" class="read_more">... read more</a>]]></description>
		<wfw:commentRss>http://blog.srinivasan.biz/software/hlint-your-friendly-code-critic-and-adviser/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Fibonacci numbers: the slow way or the fast and lazy way</title>
		<link>http://blog.srinivasan.biz/software/fibonacci-numbers-the-slow-way-or-the-fast-and-lazy-way</link>
		<comments>http://blog.srinivasan.biz/software/fibonacci-numbers-the-slow-way-or-the-fast-and-lazy-way#comments</comments>
		<pubDate>Sun, 29 Jun 2008 18:34:51 +0000</pubDate>
		<dc:creator>Babu Srinivasan</dc:creator>
				<category><![CDATA[haskell]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://blog.srinivasan.biz/?p=53</guid>
		<description><![CDATA[Fibonacci numbers are a series of numbers such as 1,1,2,3,5,8,13,21,34,55,&#8230;.

You can write a simple program, such as the one given below, in any language such as perl, python, ruby, javascript, php, java, haskell etc.

<blockquote>slowFib 0 = 1
slowFib 1 = 1
slowFib n = slowFib (n -2 ) + slowFib (n &#8211; 1) <a href="http://blog.srinivasan.biz/software/fibonacci-numbers-the-slow-way-or-the-fast-and-lazy-way" class="read_more">... read more</a></blockquote>]]></description>
		<wfw:commentRss>http://blog.srinivasan.biz/software/fibonacci-numbers-the-slow-way-or-the-fast-and-lazy-way/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

