I don't know what lazyArray does, but i can guess from the name.

Beware that the ST monad in GHC (and I believe now Hugs too) is strict
in the state. This is contrary to the semantics described in the state
monad papers. 

As a compromise between efficiency and semantic purity, both Hugs and GHC
now have a module "LazyST" that provides the "old-school" lazy state
monad semantics.


-----------------------------------------------------------------------------


Date: Fri, 8 May 98 15:03:20 EDT
From: Jan-Willem Maessen <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
To: [EMAIL PROTECTED], [EMAIL PROTECTED]
Subject: lazyArray using ST?
Resent-Date:  Fri, 8 May 1998 20:03:44 +0100
Resent-From: [EMAIL PROTECTED]
Resent-To: [EMAIL PROTECTED]

Hello.

I'm in the process of trying to port some code originally written for
hbc.  This code uses lazyArray (among other things).  I assume others
may have run into this before, but have not found mention of it in any
Haskell-related list archive.  Basically, I'm wondering if anyone has
rolled their own lazyArray for any non-hbc compiler.  I'd be interested
in any and all solutions people may have devised to implement/work
around lazyArray.  Any leads?  (Please reply directly to me,
[EMAIL PROTECTED], as well as to the lists.)

If I hear nothing, it will be time to start hacking.  I'll do what I
can with requests of the form "me, too!"

                                                -Jan-Willem Maessen



- byron

Reply via email to