This has been coming up a lot, probably because of Paul Graham's challenge:
http://www.paulgraham.com/accgen.html
So the answer is probably: it has to be done this way because that's what the
challenge specifies.
Paul's language of choice is Lisp, and he combines a higher-order function
with a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Monday 12 August 2002 02:08 pm, Scott J. wrote:
> - Original Message -
> From: "Scott J." <[EMAIL PROTECTED]>
> > What I meant was discussion about the state transformer ST s a itself.
> > And how it works. What does mean the second inner f
- Original Message -
From: "Scott J." <[EMAIL PROTECTED]>
To: "Shawn P. Garbett" <[EMAIL PROTECTED]>
Sent: Monday, August 12, 2002 9:04 PM
Subject: Re: Modification of State Transformer
> I 'm sorry,
>
> What I meant was discussion about the state transformer ST s a itself. And
> how it
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sunday 11 August 2002 07:26 pm, Scott J. wrote:
> Hi,
>
> I invite you then to explain what happens with every step.
>
> The use of "forall" is misleading and fast to be misunderstood: I mention
> here the inner forall's.
>
> Thx
>
> Scott
> > This
grr. this used to be in a FAQ at the Wiki. whatever happened to that?
The haskell wiki was just starting to pick up and gain momentum and now
it disapeared. how about we migrate the content to a more stable Wiki
platform?
http://c2.com/cgi/wiki?WikiEngines
John
On Mon, Aug 12, 2002 at 1
At 2002-08-11 23:48, I wrote:
>>I want to implement something like the C idea of:
>>n += i
>>
>>So how does one doe this in Haskell?
>
> do {
>val <- readIORef n;
>writeIORef n (val + i);
> };
Or even...
modifyIORef n ((+) i);
--
Ashley Yakeley, Seattle WA
_
