[Haskell-cafe] List comparisons and permutation group code

[Donald Bruce Stewart]

dmhouse:
> On 21/10/06, Tomasz Zielonka <tomasz.zielonka at gmail.com> wrote:
> >Do you also have this experience with Haskell?: when you feel that
> >some code is not ideal, almost always it can be improved.
> 
> One of the recurring features of the #haskell IRC conversations is
> something called 'Algorithm Golf' (which is a misnomer and should
> really be 'Algorithm Tennis'): one person will request an algorithm
> and anyone interested sets about building their own. The results are
> then shared using lambdabot's Haskell evaluation feature and
> collaboratively improved.

I also like how when doing true 'golf', with @pl, we find new
combinators:
    
    http://haskell.org/haskellwiki/Pointfree#Combinator_discoveries

Like the owl:

    ((.)$(.)) 

> I'd recommend hanging out in the channel to anyone. :)

I agree, if you're not on #haskell, you're missing out!
http://haskell.org/haskellwiki/IRC_channel :)

-- Don