You are here:
(02 Sep 2010,
Date: 2007-02-08 Time: 11:45 Room: BBL room *426* ----+++ Speaker: Arie Middelkoop ----+++ Title: Evolution of a Haskell Programmer ----+++ Abstract 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: [[http://www.willamette.edu/~fruehr/haskell/evolution.html]["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. <!-- * Set PREV_SKIN = customtitle * Set CUSTOMHEADTITLE = Evolution of a Haskell Programmer * Set CUSTOMTOPICTITLE = <em>Evolution of a Haskell Programmer</em> * Set WEBTITLE = Evolution of a Haskell Programmer --> -- Main.ArieMiddelkoop - 06 Feb 2007
08 Feb 2007 - 10:18
ore topic actions
Topic revision: r6 - 02 Sep 2010,
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding UUCS?