You can do it specifically for GHC, not not in standard Haskell (except grossly inefficiently). To see how to do it in GHC, look at the implementation in the source code (ghc/lib/std), which is online (check the "CVS repository" link on GHC's home page).
Meanwhile you could use the IArray stuff. Simon | -----Original Message----- | From: Joe English [mailto:[EMAIL PROTECTED]] | Sent: 25 November 2001 00:12 | To: [EMAIL PROTECTED] | Subject: Re: heap and walking through a very long list | | | | Simon Peyton-Jones wrote: | | > There should really be a strict accumArray, just as there | should be a | > strict foldl. | | Yes, please! | | Is there a way to write a strict version of accumArray in | Haskell 98, or does this need to be done by the implementation? | | | --Joe English | | [EMAIL PROTECTED] | | _______________________________________________ | Haskell mailing list | [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell | _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
