Re: [Haskell-cafe] How unique is Unique

There is also the UUID that guarantees uniqueness in a environment with more than one machine. http://en.wikipedia.org/wiki/Universally_unique_identifier Cheers ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

Re: [Haskell-cafe] The Lisp Curse

I think what Andrew meant is that it's not a good idea to have big pile of different implementations of the same library, and all trying to solve the very same problem. I see this kind of problem in the java community. It seems that developers have a need to create everything from scratch more

Re: [Haskell-cafe] how to optmize this code?

, On Wed, Mar 30, 2011 at 4:39 PM, Gilberto Garcia giba@gmail.com wrote: fkSum :: Int - [Int] - Int fkSum a [] = 0 fkSum a (b) = foldl (+) 0 (filter (\x - isMultiple x b) [1..a]) isMultiple :: Int - [Int] - Bool isMultiple a [] = False isMultiple a (x:xs) = if (mod a x == 0) then True

[Haskell-cafe] how to optmize this code?

Hi Haskellers, I was solving this problem from project euler to study haskell. I came up whit the following solution and I was wondering if there is a more optimized and concise solution. fkSum :: Int - [Int] - Int fkSum a [] = 0 fkSum a (b) = foldl (+) 0 (filter (\x - isMultiple x b) [1..a])

Re: [Haskell-cafe] how to optmize this code?

Thank you very much for the suggestions. giba ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe