<?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>Inviting Epiphany</title>
	<atom:link href="http://richardminerich.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://richardminerich.com</link>
	<description>A programmer&#039;s chronicle of insights and discoveries</description>
	<lastBuildDate>Sun, 15 Apr 2012 22:15:53 +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>What Microsoft MVP means to me</title>
		<link>http://richardminerich.com/2012/04/what-microsoft-mvp-means-to-me/</link>
		<comments>http://richardminerich.com/2012/04/what-microsoft-mvp-means-to-me/#comments</comments>
		<pubDate>Sun, 15 Apr 2012 22:10:20 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[Clojure]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Microsoft MVP]]></category>
		<category><![CDATA[MVP]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=1023</guid>
		<description><![CDATA[It wasn&#8217;t long after college that I found myself blogging about the technology I was using on a regular basis. I have pretty good writing skills and am damn good with the code so soon after I was easily breaking 10K hits per post. Having a platform to share my ideas and knowledge was exhilarating [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2012/04/what-microsoft-mvp-means-to-me/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>F# Event Madness, Spring 2012 Edition</title>
		<link>http://richardminerich.com/2012/04/f-event-madness-spring-2012-edition/</link>
		<comments>http://richardminerich.com/2012/04/f-event-madness-spring-2012-edition/#comments</comments>
		<pubDate>Tue, 10 Apr 2012 17:20:46 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Events]]></category>
		<category><![CDATA[Podcasts]]></category>
		<category><![CDATA[User Groups]]></category>
		<category><![CDATA[Barb]]></category>
		<category><![CDATA[F#]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=976</guid>
		<description><![CDATA[Upcoming Speaking Engagements: I&#8217;m very excited to be giving the Keynote at the first Great Lakes Functional Programming Conference, I&#8217;d suggest signing up but it&#8217;s already sold out! I&#8217;ve spent a ton of time over the last few months helping put together the first ever F# conference in the USA. Many of the most well [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2012/04/f-event-madness-spring-2012-edition/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Musicians, Mechanics, and Mathematicians</title>
		<link>http://richardminerich.com/2012/01/mechanics-musicians-and-mathematicians/</link>
		<comments>http://richardminerich.com/2012/01/mechanics-musicians-and-mathematicians/#comments</comments>
		<pubDate>Sat, 21 Jan 2012 06:35:07 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[GEB]]></category>
		<category><![CDATA[Haskell]]></category>
		<category><![CDATA[Modeling]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Scala]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=933</guid>
		<description><![CDATA[Thank you all for your comments on my previous post, I appreciate the time you all took in sharing your perspectives very much.  Many of you have brought up great analogies to demonstrate how you feel and in reading these responses I realized I must not have been very clear. There are some musical geniuses [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2012/01/mechanics-musicians-and-mathematicians/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Why do most programmers work so hard at pretending that they&#8217;re not doing math?</title>
		<link>http://richardminerich.com/2012/01/why-do-most-programmers-work-so-hard-at-pretending-that-theyre-not-doing-math/</link>
		<comments>http://richardminerich.com/2012/01/why-do-most-programmers-work-so-hard-at-pretending-that-theyre-not-doing-math/#comments</comments>
		<pubDate>Sat, 14 Jan 2012 02:36:46 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[Abstraction]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[TDD]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=906</guid>
		<description><![CDATA[In the early days programming was considered a subdiscipline of mathematics. In fact, the very first person to write an algorithm was renowned as a mathematical genius. However, somewhere along the way we forgot. We began to think of ourselves as something different, a profession not beholden to rigor or deep understanding of the models we create. It&#8217;s easy [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2012/01/why-do-most-programmers-work-so-hard-at-pretending-that-theyre-not-doing-math/feed/</wfw:commentRss>
		<slash:comments>41</slash:comments>
		</item>
		<item>
		<title>2011 In Retrospect: A Year of Writing F# Professionally</title>
		<link>http://richardminerich.com/2011/12/2011-in-retrospect-a-year-of-writing-f-professionally/</link>
		<comments>http://richardminerich.com/2011/12/2011-in-retrospect-a-year-of-writing-f-professionally/#comments</comments>
		<pubDate>Mon, 12 Dec 2011 19:53:38 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Events]]></category>
		<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[User Groups]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Monospace 2011]]></category>
		<category><![CDATA[Talks]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=892</guid>
		<description><![CDATA[For the past year I&#8217;ve been working almost entirely in F# and have found the experience to be everything I hoped it to be and better. In just six months I was able to bring a research project to fruition which has since made our company millions of dollars. F#&#8217;s terseness made algorithms a joy [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/12/2011-in-retrospect-a-year-of-writing-f-professionally/feed/</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>Advice for Getting Started with F#</title>
		<link>http://richardminerich.com/2011/10/advice-for-getting-started-with-f/</link>
		<comments>http://richardminerich.com/2011/10/advice-for-getting-started-with-f/#comments</comments>
		<pubDate>Mon, 03 Oct 2011 19:12:39 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Events]]></category>
		<category><![CDATA[Professional F# 2.0]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Learning F#]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=875</guid>
		<description><![CDATA[I had a great time at NYC Code Camp this last weekend. About half the people in my talk already knew F# and were there to talk about Type Providers, the other half just came to see what this F# thing was all about. This post is to help those in the second half begin [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/10/advice-for-getting-started-with-f/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>For whom the proteins fold</title>
		<link>http://richardminerich.com/2011/09/for-whom-the-proteins-fold/</link>
		<comments>http://richardminerich.com/2011/09/for-whom-the-proteins-fold/#comments</comments>
		<pubDate>Thu, 29 Sep 2011 00:54:24 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[Crowd Sourcing]]></category>
		<category><![CDATA[Gamification]]></category>
		<category><![CDATA[Planet Finding]]></category>
		<category><![CDATA[Protein Folding]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=842</guid>
		<description><![CDATA[I know this post isn&#8217;t of my usual technical type, but I hope you&#8217;ll bear with me while I share an idea I&#8217;ve been thinking about. Starting way back with SETI@Home, scientists have been borrowing our computer time in exchange for awesomely nerdy screen savers for years. However, it&#8217;s only fairly recently have they discovered [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/for-whom-the-proteins-fold/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Record Linkage Algorithms in F# – Extensions to Jaro-Winkler Distance (Part 3)</title>
		<link>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-extensions-to-jaro-winkler-distance-part-3/</link>
		<comments>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-extensions-to-jaro-winkler-distance-part-3/#comments</comments>
		<pubDate>Tue, 27 Sep 2011 13:15:20 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Jaro]]></category>
		<category><![CDATA[Jaro-Winkler]]></category>
		<category><![CDATA[Machine Learning]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=721</guid>
		<description><![CDATA[While writing the previous article on tokenized matching I realized I left out some important background information on Jaro-Winkler distance. First, there&#8217;s something important to know about the Jaro-Winkler distance: it&#8217;s not a metric distance and so does not obey the triangle inequality. That is, if you found the JW distance between strings A and [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/record-linkage-algorithms-in-f-extensions-to-jaro-winkler-distance-part-3/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Imperative Pseudocode to Pure Functional Algorithm with Gale-Shapely and F#</title>
		<link>http://richardminerich.com/2011/09/imperative-pseudocode-to-pure-functional-algorithm/</link>
		<comments>http://richardminerich.com/2011/09/imperative-pseudocode-to-pure-functional-algorithm/#comments</comments>
		<pubDate>Mon, 19 Sep 2011 20:51:23 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[Thoughts]]></category>
		<category><![CDATA[Abstraction]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[Functional Programming]]></category>
		<category><![CDATA[Gale-Shapely]]></category>
		<category><![CDATA[Immutable Data Structures]]></category>
		<category><![CDATA[Looping]]></category>
		<category><![CDATA[Recursion]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=781</guid>
		<description><![CDATA[Continuing from last time, let&#8217;s look at how one goes from imperative pseudocode to pure functional using Gale-Shapely as an example. Overall, to convert an algorithm from imperative to functional is a fairly simple process once you understand how to convert from a while loop to recursion with accumulators. This post is just a more [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/imperative-pseudocode-to-pure-functional-algorithm/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Record Linkage in F# &#8211; Token Matching, Stable Marriages and the Gale-Shapley algorithm</title>
		<link>http://richardminerich.com/2011/09/record-linkage-in-f-token-matching-stable-marriages-and-the-gale-shapley-algorithm/</link>
		<comments>http://richardminerich.com/2011/09/record-linkage-in-f-token-matching-stable-marriages-and-the-gale-shapley-algorithm/#comments</comments>
		<pubDate>Tue, 13 Sep 2011 13:00:53 +0000</pubDate>
		<dc:creator>Richard Minerich</dc:creator>
				<category><![CDATA[Record Linkage]]></category>
		<category><![CDATA[F#]]></category>
		<category><![CDATA[Gale-Shapely]]></category>
		<category><![CDATA[Token Alignment]]></category>

		<guid isPermaLink="false">http://richardminerich.com/?p=710</guid>
		<description><![CDATA[Initially, one of the biggest problems I found when trying to marry records was the god awful quality of much of data I often have to work with. It&#8217;s mostly old mainframe and database data with truncated fields, limited character sets and fields with nonsensical contents. Even worse, much of the data is the result [...]]]></description>
		<wfw:commentRss>http://richardminerich.com/2011/09/record-linkage-in-f-token-matching-stable-marriages-and-the-gale-shapley-algorithm/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

