<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.3" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments for Aleš Šturala | Blog | english version</title>
	<link>http://en.unitedstatesof.net</link>
	<description>Just another WordPress weblog</description>
	<pubDate>Fri, 21 Nov 2008 10:06:29 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.3</generator>
		<item>
		<title>Comment on Haskel and F# comparsion by Lasaro</title>
		<link>http://en.unitedstatesof.net/2008/01/06/haskel-and-fsharp-comparsion/#comment-279</link>
		<dc:creator>Lasaro</dc:creator>
		<pubDate>Thu, 31 Jul 2008 22:15:29 +0000</pubDate>
		<guid>http://en.unitedstatesof.net/2008/01/06/haskel-and-fsharp-comparsion/#comment-279</guid>
		<description>Union types are interesting but what if I want to represent a tree with a simple list of lists like [[[l1];[l2]];[l3]]? How can I recursively traverse such a tree in F#?</description>
		<content:encoded><![CDATA[<p>Union types are interesting but what if I want to represent a tree with a simple list of lists like [[[l1];[l2]];[l3]]? How can I recursively traverse such a tree in F#?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
