<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.9.2" -->
<rss version="0.92">
<channel>
	<title>Inadvertent incorrectness</title>
	<link>http://ken.friislarsen.net/blog</link>
	<description>... but that doesn&#039;t matter, because I turn it into a sexy dance</description>
	<lastBuildDate>Thu, 11 Sep 2008 20:01:45 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>I Am Going to JAOO 2008 As A F# Expert</title>
		<description><![CDATA[Microsoft Denmark have invited me to participate in JAOO 2008. If I in return spend some time in the Microsoft stand demoing F# and answering questions about F# and functional programming in general.
When Martin Esmann (Microsoft Academic Developer Evangelist) approached me, I told him that I&#8217;d be happy to show up, but I&#8217;m not using [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2008/09/11/i-am-going-to-jaoo-2008-as-a-f-expert/</link>
			</item>
	<item>
		<title>Getting Ready for the ICFP 2008 Programming Contest</title>
		<description><![CDATA[I&#8217;m getting ready to participate in the eleventh ICFP programming contest.
So far everything works like a charm, KVM can run the LiveCD for the contest without a problem:

kvm -cdrom ICFPCD15.iso &#38;

I hope I&#8217;ll be able to spend more time on the contest compared to last time I participated.
]]></description>
		<link>http://ken.friislarsen.net/blog/2008/07/11/getting-ready-for-the-icfp-2008-programming-contest/</link>
			</item>
	<item>
		<title>Decoding Morse Code With F# Comprehensions</title>
		<description><![CDATA[In my last post I showed how to decode morse code in Python using list comprehensions.  In this post I will show how to do it in F# instead.
First using list comprehensions:
let codes =
    [("A",".-");   ("B","-..."); ("C","-.-."); ("D","-.."); ("E",".");
     ("F","..-."); ("G","--.");  ("H","...."); ("I","..");  [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/</link>
			</item>
	<item>
		<title>Morse Code Decoding With Python List Comprehensions</title>
		<description><![CDATA[As a small exercise for getting up to speed with Python I decided to solve ruby quiz #121, which is to to write a function that finds all possible decodings of a string of Morse codes without letter- and word-separators.  Given the nature of the problem I decided to use python&#8217;s list comprehensions for [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2007/09/19/morse-code-decoding-with-python-list-comprehensions/</link>
			</item>
	<item>
		<title>Recursive Descent Parsers in C#</title>
		<description><![CDATA[Peter Sestoft and I have written a note about how to write scanners and parsers in C#. The note is based on earlier versions for SML and Java.
The note contains an thorough introduction to grammars on Backus&#8211;Naur form (BNF).  This includes a description of properties your grammar should have so that it can be [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2006/09/08/recursive-descent-parsers-in-c/</link>
			</item>
	<item>
		<title>ICFP Contest 2006, Team KFL</title>
		<description><![CDATA[In 1967, during excavation for the construction of a new shopping center in Monroeville, Pennsylvania, workers uncovered a vault containing a cache of ancient scrolls. Most were severely damaged, but those that could be recovered confirmed the existence of a secret society long suspected to have been active in the region around the year 200 [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2006/07/27/icfp-contest-2006-team-kfl/</link>
			</item>
	<item>
		<title>Theory of evolution</title>
		<description><![CDATA[There is no theory of evolution. Just a list of creatures Chuck Norris has allowed to live.
]]></description>
		<link>http://ken.friislarsen.net/blog/2006/01/05/theory-of-evolution/</link>
			</item>
	<item>
		<title>Refactoring SML Quiz, Part 2</title>
		<description><![CDATA[The answer to yesterdays quiz is: Yes, types are necessary for lambda-lifting refactoring. Namely, if the lifted function contains an overloaded operator such as, e.g., +.
For example, given the program:

fun foo x =
    let fun add y = x + y
    in  add 5.0 end

where we want to [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2005/12/21/refactoring-sml-quiz-part-2/</link>
			</item>
	<item>
		<title>Refactoring SML Quiz, Part 1</title>
		<description><![CDATA[Yesterday, I discussed with some students who are implementing an SML plug-in for eclipse, whether types are necessary for a lambda-lifting refactoring for SML.
So today&#8217;s quiz is simply: Are types necessary for lambda-lifting refactoring in SML? Why/Why not?
Remember, the refactoring works on valid SML programs, and after the transformation the program should still be valid.
Example:

fun [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2005/12/20/refactoring-sml-quiz/</link>
			</item>
	<item>
		<title>Implementing the generic IEnumerable interface</title>
		<description><![CDATA[Say you want to implement a class that implements the IEnumerable interface in C#.  Then you have two choices, either to implement the old-style non-generic IEnumerable interface or you can implements the generic IEnumerable&#60;T&#62; interface.  Given those choices we of course want to implement the new generic version of the interface.  Because [...]]]></description>
		<link>http://ken.friislarsen.net/blog/2005/07/25/implementing-the-generic-ienumerable-interface/</link>
			</item>
</channel>
</rss>
