[Haskell-cafe] ANN: tf-random 0.1 (splittable pseudorandom number generator)

2013-09-19 Thread Michał Pałka
Dear all, I am happy to announce the release of tf-random 0.1. tf-random is a high-quality splittable pseudorandom number generator intended to address the random number quality problems of the standard Haskell StdGen generator. tf-random uses a cryptographic hash function under the hood to

Re: [Haskell-cafe] Password hashing

2008-10-28 Thread Michał Pałka
On Tue, 2008-10-28 at 18:49 +0300, Bulat Ziganshin wrote: Tuesday, October 28, 2008, 6:42:34 PM, you wrote: What library can be used to securely hash passwords? From what I any secure hash, say SHA512 It's a good idea to salt your passwords before hashing, though. See

Re: [Haskell-cafe] Installing ghc + gtk2hs on linux

2008-10-21 Thread Michał Pałka
Hi Bulat, (Note, I'm not using Ubuntu) You may use the packaged versions from Ubuntu. According to http://packages.ubuntu.org/ Hardy (which is the current version of Ubuntu) has GHC vesion 6.8.2-2ubuntu1 and gtk2hs version 0.9.12.1-1ubuntu2. Ubuntu package names are ghc6 and libghc6-gtk-dev

Re: [Haskell-cafe] how do i use quickcheck in the IO monad?

2008-09-23 Thread Michał Pałka
On Mon, 2008-09-22 at 12:35 -0700, Anatoly Yakovenko wrote: If i have functions in the IO monad, is there a way to use quickcheck to test them? I have a bunch of C bindings that unfortunately are not safe. But i would like to be able to use QuickCheck to test them. Hi Anatoly, If you want

Re: [Haskell-cafe] Re: Haskell stacktrace

2008-09-10 Thread Michał Pałka
I was going to suggest using the -xc option of the GHC runtime (if you are using GHC), but it seems that it doesn't always give meaningful results as indicated here: http://osdir.com/ml/lang.haskell.glasgow.bugs/2006-09/msg8.html and here:

Re: [Haskell-cafe] How to do this in FP way?

2008-06-16 Thread Michał Pałka
On Mon, 2008-06-16 at 10:19 +0200, Ketil Malde wrote: Magicloud Magiclouds [EMAIL PROTECTED] writes: static int old; int diff (int now) { /* this would be called once a second */ int ret = now - old; old = now; return ret; } Because there is no variable in Haskell. So

Re: [Haskell-cafe] naming a data structure for weighted random selection without replacement

2008-02-18 Thread Michał Pałka
On Mon, 2008-02-18 at 11:37 +, Luke Palmer wrote: On Feb 18, 2008 5:11 AM, Stuart Cook [EMAIL PROTECTED] wrote: A while ago I wrote a little data structure that allows weighted random selection-without-replacement from a collection of values in O(log n) time.[1] I'm now in the process

Re: [Haskell-cafe] Why functional programming matters

2008-01-23 Thread Michał Pałka
On Wed, 2008-01-23 at 13:29 +, Simon Peyton-Jones wrote: 1. Small examples of actual code. The goal here is (a) to convey a visceral idea of what functional programming *is*, rather than just assume the audience knows (they don't), and (b) to convey an idea of why it might be good. Hello,