<?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>Dmitry Leskov &#187; Haskell</title>
	<atom:link href="http://blog.dmitryleskov.com/category/programming/haskell/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.dmitryleskov.com</link>
	<description></description>
	<lastBuildDate>Thu, 04 Oct 2018 17:01:31 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.4.2</generator>
		<item>
		<title>The Finite Laziness of Scala Streams</title>
		<link>http://blog.dmitryleskov.com/programming/scala/the-finite-laziness-of-scala-streams/</link>
		<comments>http://blog.dmitryleskov.com/programming/scala/the-finite-laziness-of-scala-streams/#comments</comments>
		<pubDate>Sun, 03 Jul 2016 09:35:05 +0000</pubDate>
		<dc:creator>Dmitry Leskov</dc:creator>
				<category><![CDATA[Haskell]]></category>
		<category><![CDATA[Scala]]></category>

		<guid isPermaLink="false">http://blog.dmitryleskov.com/?p=1346</guid>
		<description><![CDATA[The official Haskell wiki discusses literally dozens of ways to produce a list of prime numbers, but the one that caught my attention the other day is not listed there. Its centerpiece is a fold of a recursively defined infinite list of infinite lists (lists are lazy in Haskell). In this post, I've documented my attempt to rewrite it in Scala using streams.]]></description>
		<wfw:commentRss>http://blog.dmitryleskov.com/programming/scala/the-finite-laziness-of-scala-streams/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
