On 10 July 2013 14:10, kudah wrote:
> Yes, it does. Without optimizations the result is
> "ndgorsfesnywaiqraloa", while with optimizations the result is always
> "aabb".
>
Sorry for taking so long. So problem is uniformR. You can reproduce bug
reliably and I cannot. Are you on 32-b
For what it's worth, I think a non-recursive in the language would
just bring more confusion, in forums, IRC and whereever. The benefits
don't seem important at all, and the same effect can be achieved
through other means.
On Wed, Jul 17, 2013 at 2:20 AM, Richard A. O'Keefe wrote:
> Brian Marick
Hello,
Please, find below the first call for papers for PEPM 2014.
Please forward these to anyone you think may be interested.
Apologies for any duplicates you may receive.
best regards,
Jurriaan Hage
Co-chair of PEPM 2014
-
Hi Greeg.
Nice I will publish the mechanism in a separate package once I clean it up
At first sight, It is possible to use file-location and monad-logger with
the traces instead of monadloc. In the meantime, I will advance to you a
copy of the details in a separate mail.
2013/7/16 Greg Weber
Test triggers the bug, only zeros and ones like you said, but
only for native-sized types:
-O2:
Int
0 0 0 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 0 0
Int32
41 37 25 85 27 84 70 8 70 32 36 1 14 92 1 74 17 28 38 76
Int64
37 77 57 75 17 58 28 77 23 51 1 13 50 35 21 11 70 43 6 5
Word
0 0 1 1 0 0 1 0 0 0 0 0
This has all the marks of a 64-bit-only code running on a 32 bit machine.
It looks like you're getting the high bits of the rng with a signed shift
right, ultimately yielding only the sign bit.
I suspect mwc-random needs to use Int64 rather than Int internally in a few
critical places.
On Wed,
On 2013.07.17, at 08:03, Jan-Willem Maessen wrote:
> This has all the marks of a 64-bit-only code running on a 32 bit
> machine.
This discussion is interesting, but I'm not sure why so much of it is
taking place here instead of on the mwc-random issue tracker:
https://github.com/bos/mwc-random/iss
Jose A. Lopes, Wed 2013-07-17 @ 13:36:01+0200:
> I am quite new to template haskell and I am still trying to get the
> hang of it. How can I achieve something like the following Common Lisp
> code ?
>
> `(,fn ,arg1 ,arg2)
>
> Or is there a more Haskelley way of doing this ?
The naive translation
Hi!
I’m glad to announce new versions of the Aivika [1] simulation library
and its additional packages Aivika Experiment [2] and Aivika Experiment
Chart [3]. The library is divided to decrease the dependency on GTK,
although all three were tested on Linux, Windows and OS X.
They allow develo
Here, again, is your ACTUAL CODE, commented, deployed, looping, and
maybe linked into your projects, if you are not careless about the cabal
constraints:
http://hackage.haskell.org/packages/archive/mtl/2.1/doc/html/src/Control-Monad-State-Class.html#state
-- | Embed a simple state action i
This happened because I copied the surrounding style blindly. I fucked up.
state f = get >>= \s -> case f s of
(a, s) -> do
put s
return a
would not have the problem and would have given a warning about name
shadowing.
I for one am somewhat neutral on the *adding* a non-recursive le
FWIW, I maintain, according to wc and sloccount, 220841 lines worth of
Haskell code at present.
I have been bitten this error one time, so it affects me .45% of the
time and that was only because it was in the only package I was not using
-Wall on.
-Edward
On Wed, Jul 17, 2013 at 12:23 PM, A
Welcome to issue 273 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of June 30 to July 13, 2013.
Quotes of the Week
* monochrom: 8-bit word uses less memory, but if it doesn't have to
preserve information, I kn
13 matches
Mail list logo
