Since this week's slot is vacant, and I didn't give a presentation for a while, I've been working this weekend to fill up this slot. I picked one of the Haskell-humor articles from the web: "Evolution of a Haskell Programmer". This article contains many different (and funny) implementations of the factorial function (in growing order of complexity). Among these implementations are two variants that show some neat tricks: a version of the factorial function using SKI-combinators and a static version where the Haskell compiler itself computes the result. I sometimes encounter uses of these tricks in papers, so I think it is worthwhile to explain them to you.
-- ArieMiddelkoop - 06 Feb 2007