Note to �ber-Haskellers:
<ul>
<li>For pedagogical reasons, I'm only using lists for all data structures in this tutorial. I also do lots of other things that are not performance friendly- My top concerns were <i>simplicity</i> and getting the program to do something <i>fun</i> with a minimal learning curve. I tried to be careful and succinctly mention any inefficiencies at the end of each section. I have another, far more complex version that uses arrays, hashmaps, maps, etc. and runs like 3.7 zillion times faster using typical datasets.</li>
<li>As I'm a semi-newbie myself, I'd love to know what tricks are possible to make this code even shorter, simpler, and more elegant. Please email me any improvements! I want to continuously refine the tutorial so that it'll really show the brillance of the language to the <i>Haskell-curious</I> as much as possible- I'm sure many improvements are still possible!</li>
<li>SEE YOU IN FREIBURG THIS WEEKEND!!!</li>
</ul>
Conrad Barski, M.D.