On 8/14/07, Dougal Stanton <[EMAIL PROTECTED]> wrote: > I'm looking for cool but mind-bending examples of functional brilliance.
One of my favourite examples is: http://citeseer.ist.psu.edu/hinze99functional.html Anyone who studies binomial heaps is struck by the similarity to binary arithmetic. What Hinze does is formalise that similarity so that binomial heaps and binary numbers are instances of the same type class. Very pretty. -- Dan _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
