"Eli Ford" <[EMAIL PROTECTED]> wrote:
> > > Is there a better way than IORefs
> > >
> > The state Monad.
>
> Do you mean one state shared among all actors, like this?
>
> type MGame = State GameState
> newtype GameState = GameState { }
>
> That gets part of the way, but I'm thinkin
I found some code that I want to run and that imports GraphicsUtils ...
On Thu, Oct 30, 2008 at 12:25 AM, Don Stewart <[EMAIL PROTECTED]> wrote:
> vigalchin:
> >Hello,
> >
> > What is the suggested migration path from the Hugs GraphicsUtils
> to
> >contemporary Haskell??
> >
> >
vigalchin:
>Hello,
>
> What is the suggested migration path from the Hugs GraphicsUtils to
>contemporary Haskell??
>
>Thanks, Vasili
I don't believe anyone has ever asked that question.
If you're doing graphics, in modern Haskell, I'd suggest gtk2hs + ghc.
http://h
Hello,
What is the suggested migration path from the Hugs GraphicsUtils to
contemporary Haskell??
Thanks, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 30 Oct 2008, at 9:22 am, Andrew Coppin wrote:
I'm not really interested in getting down to instruction-level
scheduling. I just want to know, at a high level, will implementing
my algorithm in integer arithmetic rather than floating-point make a
measurable difference to overall program sp
> > Is there a better way than IORefs
> >
> The state Monad.
Do you mean one state shared among all actors, like this?
type MGame = State GameState
newtype GameState = GameState { }
That gets part of the way, but I'm thinking of a situation where each
instance of a particular ty
"Eli Ford" <[EMAIL PROTECTED]> wrote:
> Is there a better way than IORefs
>
Without looking at the code: The state Monad. Imperative
implementations of games are usually[1] modelled as finite automata,
there's no reason to do it any different in a functional language. Add
a bit of glue to transla
On Wed, Oct 29, 2008 at 6:16 PM, Trent W. Buck <[EMAIL PROTECTED]> wrote:
> David Roundy <[EMAIL PROTECTED]> writes:
>
>> And as far as bundled versions, it's the desire to *remove* a bundled
>> version that's apparently at issue. I'm not sure why this is
>> considered desirable, but apparently so
David Roundy <[EMAIL PROTECTED]> writes:
> And as far as bundled versions, it's the desire to *remove* a bundled
> version that's apparently at issue. I'm not sure why this is
> considered desirable, but apparently some folks feel strongly about
> this.
Could someone please summarize what code i
That’s great -- easy to follow, even though I can’t read the comments. ^^
It’s not possible for actors to ‘watch’ each other in this system, correct?
For instance, if one actor holds a reference to another, it will keep that old
version of the actor alive, but it won’t see when the actor mo
Conal, I tried this today on a VirtualBox VM running the same versions
as Mark Wassell, and it worked for me... I wonder, though, if perhaps
GLUT is not getting a GLX (or direct) video context on your machine
for some reason. That has caused some of my GLUT programs to die in
the past, no matter
One more thing, I also had to add my cygwin bin directory containing
"sh.exe" to my Windows %PATH% variable. This allowed network to configure
from the windows command prompt.
/jve
On Wed, Oct 29, 2008 at 8:37 PM, John Van Enk <[EMAIL PROTECTED]> wrote:
> Hello All,
>
> I'm trying to reinstall
Hello All,
I'm trying to reinstall network-2.2.0.0 against Parsec 3 in Windows. Well,
this is really hard/impossible to do. Here's what I've done so far:
1) After bashing my face against my desk for a while, I got cabal-install
installed in windows.
2) cabal install network --reinstall
3) This fre
Please be careful not to invent or reinvent a password hashing scheme.
I'd go with bcrypt. That'd be a worthy module.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
In general, it is recommended that password hash functions are
comparatively *slow* in order to make offline attacks harder. You can
somewhat emulate this by running the hashing function multiple times.
And, of course, salting should always be done.
2008/10/28 Bulat Ziganshin <[EMAIL PROTECTED]>:
Duncan Coutts <[EMAIL PROTECTED]> writes:
> I'd just like to point out (again ;-) ) than it's not that hard to
> support older platforms. The only constraint is that people not squeal
> at the sight of bundled code. The bundling can be done in such a way
> that it's not a maintenance burden, indeed
Andrew.Butterfield:
>
> >someone asked:
> >>>What can be used for generating a random salt? Is System.Random
> >>>secure enough?
> >>>
> Achim Schneider wrote:
> >...or by pinging a random host and taking the time difference, checking
> >the current cpu temperature and fan speed, counting ho
someone asked:
What can be used for generating a random salt? Is System.Random
secure enough?
Achim Schneider wrote:
...or by pinging a random host and taking the time difference, checking
the current cpu temperature and fan speed, counting how many times
your process gets suspended in
jwlato:
> On Tue, Oct 28, 2008 at 5:43 PM, Don Stewart <[EMAIL PROTECTED]> wrote:
> > jwlato:
> >> Hello,
> >>
> >> I was experimenting with using ghc-6.10.0.20081007 on a project, and
> >> it seems that binary-0.4.3.1 has markedly worse performance in certain
> >> cases. With the following simple
On Wed, Oct 29, 2008 at 7:58 PM, Ryan Ingram <[EMAIL PROTECTED]> wrote:
> Actually, this is a good question, at least as relating to floating
> point values. Is there a primitive to view the machine representation
> of floats?
This isn't the first time this issue has come up on this mailing list.
OK, well thanks for the info.
I'm not really interested in getting down to instruction-level scheduling. I
just want to know, at a high level, will implementing my algorithm in integer
arithmetic rather than floating-point make a measurable difference to overall
program speed.
Actually, t
Richard O'Keefe wrote:
On 29 Oct 2008, at 8:31 am, Andrew Coppin wrote:
Hi guys.
This isn't specifically to do with Haskell, but... does anybody have
any idea roughly how fast various CPU operations are?
For example, is integer arithmetic faster or slower than
floating-point? Is addition
magicloud.magiclouds:
> Hi,
>Xmonad needs Data.Generics from base3. And I found out that there is
> a "compat-base3" in ghc 6.10, which has Data.Generics.
>But `ghc -v` reports that base-3.0.3.0 is hidden. So I wonder how
> could I compile Xmonad with ghc 6.10?
Upgrade to cabal-install 0
Ryan Ingram <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.haskell.cafe:
> Actually, this is a good question, at least as relating to floating
> point values. Is there a primitive to view the machine representation
> of floats?
Not a primitive, but it can be defined:
Actually, this is a good question, at least as relating to floating
point values. Is there a primitive to view the machine representation
of floats?
I'm thinking of functions like:
reinterpretFloatAsWord :: Float -> Word32
reinterpretWordAsFloat :: Word32 -> Float
reinterpretDoubleAsWord :: Doub
Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
> Hello Bit,
>
> Wednesday, October 29, 2008, 4:32:51 PM, you wrote:
>
> >> It's a good idea to salt your passwords before hashing, though. See
> > What can be used for generating a random salt? Is System.Random
> > secure enough?
>
> if you use mkStdR
On Wed, Oct 29, 2008 at 8:01 AM, David Roundy <[EMAIL PROTECTED]> wrote:
> On Wed, Oct 29, 2008 at 11:17:35AM -, Mitchell, Neil wrote:
>> Duncan,
>>
>> I believe the major darcs issue is the changed GADT implementation
>> between 6.6, so that neither 6.6 or 6.8 is a superset/subset of the
>> ot
On Wed, Oct 29, 2008 at 12:11:22PM +1100, Trent W. Buck wrote:
> To my mind, the benefit is negligible, because:
>
> Then we still have OpenBSD users.
>
> means we can't drop GHC 6.6 support. Also, note that Lenny has 6.8,
> and it is scheduled to become stable Real Soon Now.
Ok, it all depen
On Wed, Oct 29, 2008 at 10:40:48AM +0700, Donald Halomoan wrote:
> Where can I get ghc-6.10? I cannot see it at haskell.org website.
No releases from the 6.10 branch have been made yet.
Thanks
Ian
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.or
On Wed, Oct 29, 2008 at 11:17:35AM -, Mitchell, Neil wrote:
> Duncan,
>
> I believe the major darcs issue is the changed GADT implementation
> between 6.6, so that neither 6.6 or 6.8 is a superset/subset of the
> other - leading to a situation where they have to use a common subset of
> both.
On Wed, Oct 29, 2008 at 4:17 AM, Mitchell, Neil
<[EMAIL PROTECTED]> wrote:
> Duncan,
>
> I believe the major darcs issue is the changed GADT implementation
> between 6.6, so that neither 6.6 or 6.8 is a superset/subset of the
> other - leading to a situation where they have to use a common subset o
Hello Bit,
Wednesday, October 29, 2008, 4:32:51 PM, you wrote:
>> It's a good idea to salt your passwords before hashing, though. See
> What can be used for generating a random salt? Is System.Random secure enough?
if you use mkStdRNG it's good enough for non high-secure programs. it
inits rnd g
On Tue, Oct 28, 2008 at 5:56 PM, Michał Pałka <[EMAIL PROTECTED]> wrote:
> It's a good idea to salt your passwords before hashing, though. See
> http://en.wikipedia.org/wiki/Salt_(cryptography)
What can be used for generating a random salt? Is System.Random secure enough?
Thanks
_
-- Forwarded message --
From: Alberto G. Corona <[EMAIL PROTECTED]>
Date: 2008/10/29
Subject: Re: [Haskell-cafe] ANNOUNCE: Data.TCache 0.5.1
To: Joachim Breitner <[EMAIL PROTECTED]>
I developed it in 2006. At this time I think that Happs did not used STM. I
do not know Happs.State
On Mon, 2008-10-27 at 19:24 -0700, Jason Dagit wrote:
> Hello,
>
> I would like to find out if any darcs users who build from the source
> are still using ghc 6.6?
I'd just like to point out (again ;-) ) than it's not that hard to
support older platforms. The only constraint is that people not sq
Duncan,
I believe the major darcs issue is the changed GADT implementation
between 6.6, so that neither 6.6 or 6.8 is a superset/subset of the
other - leading to a situation where they have to use a common subset of
both.
Thanks
Neil
> -Original Message-
> From: [EMAIL PROTECTED]
> [ma
On Tue, Oct 28, 2008 at 5:43 PM, Don Stewart <[EMAIL PROTECTED]> wrote:
> jwlato:
>> Hello,
>>
>> I was experimenting with using ghc-6.10.0.20081007 on a project, and
>> it seems that binary-0.4.3.1 has markedly worse performance in certain
>> cases. With the following simple test:
>>
>> > import
Hi,
Xmonad needs Data.Generics from base3. And I found out that there is
a "compat-base3" in ghc 6.10, which has Data.Generics.
But `ghc -v` reports that base-3.0.3.0 is hidden. So I wonder how
could I compile Xmonad with ghc 6.10?
Thanks.
___
Hi,
Works here:
Windows XP SP 3
ghc-6.10.20081007
glut32 from http://www.xmission.com/~nate/glut.html
Don't know if this will help:
DLLS loaded
glut32.dll0x10000x38000C:\WINDOWS\glut32.dll
opengl32.dll0x5ed00xcc000C:\WINDOWS\system32\opengl32.dll
glu32.dll0
http://www.haskell.org/ghc/dist/stable/dist/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
40 matches
Mail list logo
