<?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>getting #er &#187; F#</title>
	<atom:link href="http://gettingsharper.de/tag/fsharp/feed/" rel="self" type="application/rss+xml" />
	<link>http://gettingsharper.de</link>
	<description>mastering .net, programming and other stuff</description>
	<lastBuildDate>Thu, 05 Apr 2012 13:14:27 +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>infinite lazy-lists and folding them in f#</title>
		<link>http://gettingsharper.de/2012/04/04/infinite-lazy-lists-and-folding-them-in-f/</link>
		<comments>http://gettingsharper.de/2012/04/04/infinite-lazy-lists-and-folding-them-in-f/#comments</comments>
		<pubDate>Wed, 04 Apr 2012 16:07:07 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[functional programming]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[foldr]]></category>
		<category><![CDATA[lazy]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=430</guid>
		<description><![CDATA[On key-feature in Haskell is it’s laziness, meaning that it does it’s evaluations in normal-order (an expression is evaluated when the value is needed). F# on the other hand uses applicative evaluation (for example: parameters to a function are evaluated &#8230; <a href="http://gettingsharper.de/2012/04/04/infinite-lazy-lists-and-folding-them-in-f/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2012/04/04/infinite-lazy-lists-and-folding-them-in-f/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>get test support for XUnit and NUnit in VS11 beta</title>
		<link>http://gettingsharper.de/2012/03/05/get-test-support-for-xunit-and-nunit-in-vs11-beta/</link>
		<comments>http://gettingsharper.de/2012/03/05/get-test-support-for-xunit-and-nunit-in-vs11-beta/#comments</comments>
		<pubDate>Mon, 05 Mar 2012 12:53:51 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[Small things that could help]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[MsTest]]></category>
		<category><![CDATA[NUnit]]></category>
		<category><![CDATA[UnitTest]]></category>
		<category><![CDATA[VS11 beta]]></category>
		<category><![CDATA[XUnit]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=398</guid>
		<description><![CDATA[after banging my head against the wall because the test runner did not find my tests I finally found the reason: you have to install additional plugins into VS11 (beta). And it seems like they are not part of the &#8230; <a href="http://gettingsharper.de/2012/03/05/get-test-support-for-xunit-and-nunit-in-vs11-beta/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2012/03/05/get-test-support-for-xunit-and-nunit-in-vs11-beta/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>a correct &#8216;modulus&#8217; for F#</title>
		<link>http://gettingsharper.de/2012/02/28/how-to-implement-a-mathematically-correct-modulus-operator-in-f/</link>
		<comments>http://gettingsharper.de/2012/02/28/how-to-implement-a-mathematically-correct-modulus-operator-in-f/#comments</comments>
		<pubDate>Tue, 28 Feb 2012 15:47:00 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math coding]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[modulus]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=385</guid>
		<description><![CDATA[In math we use the remainder for modular-arithmetic. That is given two numbers and we already saw that we can express as where is in the range – and we call this the remainder of dividing by , so for &#8230; <a href="http://gettingsharper.de/2012/02/28/how-to-implement-a-mathematically-correct-modulus-operator-in-f/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2012/02/28/how-to-implement-a-mathematically-correct-modulus-operator-in-f/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>The Chinese remainder theorem</title>
		<link>http://gettingsharper.de/2012/01/24/the-chinese-remainder-theorem/</link>
		<comments>http://gettingsharper.de/2012/01/24/the-chinese-remainder-theorem/#comments</comments>
		<pubDate>Tue, 24 Jan 2012 21:13:39 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math coding]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[number theory]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=362</guid>
		<description><![CDATA[I hope to do a series covering some theory and implementation of the RSA algorithm in F# in the near future – and one of it’s main ingredients (for simplifying the hard calculations) is the Chinese remainder theorem – so &#8230; <a href="http://gettingsharper.de/2012/01/24/the-chinese-remainder-theorem/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2012/01/24/the-chinese-remainder-theorem/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>toying with lazy sequences and the fixed-point combinator in F#</title>
		<link>http://gettingsharper.de/2011/12/15/toying-with-lazy-sequences-and-the-fixed-point-combinator-in-f/</link>
		<comments>http://gettingsharper.de/2011/12/15/toying-with-lazy-sequences-and-the-fixed-point-combinator-in-f/#comments</comments>
		<pubDate>Thu, 15 Dec 2011 16:23:25 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[functional programming]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Haskell]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=355</guid>
		<description><![CDATA[I recently watched this great cast from Graham Hutton on Channel 9: How to be more productive. Right at the beginning he shows us another application of the fixed-point combinator and this got me into the “Haskell/Lazy love”-mode again. So &#8230; <a href="http://gettingsharper.de/2011/12/15/toying-with-lazy-sequences-and-the-fixed-point-combinator-in-f/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2011/12/15/toying-with-lazy-sequences-and-the-fixed-point-combinator-in-f/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>a generic polynomial type in F#</title>
		<link>http://gettingsharper.de/2011/12/14/a-generic-polynomial-type-in-f/</link>
		<comments>http://gettingsharper.de/2011/12/14/a-generic-polynomial-type-in-f/#comments</comments>
		<pubDate>Wed, 14 Dec 2011 00:00:49 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math coding]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[polynomials]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=349</guid>
		<description><![CDATA[In this short article I want to show how to implement a simple polynomial type in F# over a generic field. For this I will use the technique introduced in this great article: Writing generic numeric code So you will &#8230; <a href="http://gettingsharper.de/2011/12/14/a-generic-polynomial-type-in-f/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2011/12/14/a-generic-polynomial-type-in-f/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>FunTracer: Textures and Fog</title>
		<link>http://gettingsharper.de/2011/12/09/funtracer-textures-and-fog/</link>
		<comments>http://gettingsharper.de/2011/12/09/funtracer-textures-and-fog/#comments</comments>
		<pubDate>Fri, 09 Dec 2011 00:00:49 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Raytracing]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=342</guid>
		<description><![CDATA[In this post I will introduce the concept of textures (and apply it to our plane-primitive) and explain why I choose to add a fog effect. This is the texture we are going to tile to our “floor”: What is &#8230; <a href="http://gettingsharper.de/2011/12/09/funtracer-textures-and-fog/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2011/12/09/funtracer-textures-and-fog/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>FunTracer: adding planes to the picture</title>
		<link>http://gettingsharper.de/2011/12/08/funtracer-adding-planes-to-the-picture/</link>
		<comments>http://gettingsharper.de/2011/12/08/funtracer-adding-planes-to-the-picture/#comments</comments>
		<pubDate>Thu, 08 Dec 2011 16:00:02 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math coding]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Raytracing]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=325</guid>
		<description><![CDATA[Today we start adding another primitive to the scene – a plane. This is what we are looking for: and here is the code that will finally render this: But before going into the implementation of the Plane.Create method let’s &#8230; <a href="http://gettingsharper.de/2011/12/08/funtracer-adding-planes-to-the-picture/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2011/12/08/funtracer-adding-planes-to-the-picture/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>FunTracer: reflection</title>
		<link>http://gettingsharper.de/2011/12/07/funtracer-reflection/</link>
		<comments>http://gettingsharper.de/2011/12/07/funtracer-reflection/#comments</comments>
		<pubDate>Wed, 07 Dec 2011 17:00:39 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math coding]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Raytracing]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=319</guid>
		<description><![CDATA[It’s time for one of flagship-features of ray tracing: reflection. Indeed this will be rather easy (again) – we basically did have every thing we need already – all that is left is to introduce some recursion in the tracing &#8230; <a href="http://gettingsharper.de/2011/12/07/funtracer-reflection/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2011/12/07/funtracer-reflection/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>FunTracer: specular lightning</title>
		<link>http://gettingsharper.de/2011/12/07/funtracer-specular-lightning/</link>
		<comments>http://gettingsharper.de/2011/12/07/funtracer-specular-lightning/#comments</comments>
		<pubDate>Wed, 07 Dec 2011 00:00:59 +0000</pubDate>
		<dc:creator>Carsten</dc:creator>
				<category><![CDATA[math coding]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Raytracing]]></category>

		<guid isPermaLink="false">http://gettingsharper.de/?p=287</guid>
		<description><![CDATA[This time we are going to add specular lightning – this will add “shiny”ness on objects. The basic idea is simple: we reflect the currently traced ray, at the hit-point (using the normal of the object at this point) and &#8230; <a href="http://gettingsharper.de/2011/12/07/funtracer-specular-lightning/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://gettingsharper.de/2011/12/07/funtracer-specular-lightning/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

