Re: efficiency of FiniteMap and Set

2003-12-30 Thread ajb
G'day all. Quoting Wolfgang Jeltsch <[EMAIL PROTECTED]>: > is there some documentation about the complexity of the FiniteMap and Set > operations? More information than you could ever want is here: http://www.swiss.ai.mit.edu/users/adams/BB/ Cheers, Andrew Bromage _

Re: no continuations

2003-12-30 Thread ajb
G'day all. Quoting Tomasz Zielonka <[EMAIL PROTECTED]>: > BTW, the factorial example on > http://www.haskell.org/hawiki/MonadicContinuationPassingStyle > seems rather pointless to me, because it doesn't use any methods > of MonadCont (like callCC). The only point of the factorial example is to

safe array freezing?

2003-12-30 Thread John Meacham
so, A common idiom when using Control.Monad.ST is to do some complicated, state using computation to compute a big array which is then used purely functionally as a read-only array in the rest of the program. to avoid the cost of copying the array at the end, we are forced to use 'unsafeFreeze'.

Re: no continuations

2003-12-30 Thread Amr A Sabry
Kevin S. Millikin <[EMAIL PROTECTED]> wrote: > Oh, sure. I didn't mean to quibble with the idea that continuations > are computational effects. Just wanted to point out that (I think) you > can't macro express mutation with call/cc, unless you've already got > mutation anyway. That's right:

Re: no continuations

2003-12-30 Thread Derek Elkins
On Tue, 30 Dec 2003 10:38:33 -0800 (PST) Ben Rudiak-Gould <[EMAIL PROTECTED]> wrote: > On Tue, 30 Dec 2003, Scott wrote: > > Why does Haskell have no continuations? > > (http://www.haskell.org/hawiki/CoMonad) > > If continuations are incompatible with non-strict semantics, I'd > > appreciate an e

Re: from array update algorithm to nice Haskell code

2003-12-30 Thread Daan Leijen
Hi Wolfgang, is there some documentation about the complexity of the FiniteMap and Set operations? My DData library gives some useful links to papers about this subject, also take a look at the "IntSet" and "IntMap" libraries as they have an interesting complexity class. Also, all DData functions

RE: no continuations

2003-12-30 Thread Kevin S. Millikin
On Tuesday, December 30, 2003 3:10 PM, Ben Rudiak-Gould [SMTP:[EMAIL PROTECTED] wrote: > Interesting. > > This still violates referential transparency, though. (c 'get) returns > a value or errors out depending on whether (c 'set) has been called yet. Oh, sure. I didn't mean to quibble with th

from array update algorithm to nice Haskell code

2003-12-30 Thread Wolfgang Jeltsch
Hello, I have an algorithm which updates one or more arrays in a loop. The update operations depend on the (old) contents of the arrays, so I cannot use accumArray. I want to implement this algorithm without mutable arrays in Haskell. Are there any possibilities to do so efficiently? Are th

efficiency of FiniteMap and Set

2003-12-30 Thread Wolfgang Jeltsch
Hello, is there some documentation about the complexity of the FiniteMap and Set operations? Wolfgang ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

RE: no continuations

2003-12-30 Thread Ben Rudiak-Gould
On Tue, 30 Dec 2003, Kevin S. Millikin wrote: > On Tuesday, December 30, 2003 12:39 PM, Ben Rudiak-Gould wrote: > > With letrec and unrestricted call/cc you can implement ML-style refs: > > With an *implementation of letrec that uses mutation* and unrestricted > call/cc, you can implement ML-styl

RE: no continuations

2003-12-30 Thread Kevin S. Millikin
On Tuesday, December 30, 2003 12:39 PM, Ben Rudiak-Gould [SMTP:[EMAIL PROTECTED] wrote: > > With letrec and unrestricted call/cc you can implement ML-style refs: With an *implementation of letrec that uses mutation* and unrestricted call/cc, you can implement ML-style ref cells: Petite Chez Sch

Re: no continuations

2003-12-30 Thread Ben Rudiak-Gould
On Tue, 30 Dec 2003, Scott wrote: > Why does Haskell have no continuations? > (http://www.haskell.org/hawiki/CoMonad) > If continuations are incompatible with non-strict semantics, I'd > appreciate an explanation. With letrec and unrestricted call/cc you can implement ML-style refs: (define (m

Re: no continuations

2003-12-30 Thread Tomasz Zielonka
On Tue, Dec 30, 2003 at 07:21:08AM -0600, Scott wrote: > Why does Haskell have no continuations? > (http://www.haskell.org/hawiki/CoMonad) See http://www.haskell.org/hawiki/MonadCont BTW, the factorial example on http://www.haskell.org/hawiki/MonadicContinuationPassingStyle seems rather point

Re: no continuations

2003-12-30 Thread Lennart Augustsson
I'm not sure what your question means. You can make your own continuations, so in that sense Haskell has them. But perhaps you're asking why Haskell lacks something like call/cc in Scheme which allows you to grab the current continuation? This doesn't play very well with graph reduction (which mos

no continuations

2003-12-30 Thread Scott
Why does Haskell have no continuations? (http://www.haskell.org/hawiki/CoMonad) If continuations are incompatible with non-strict semantics, I'd appreciate an explanation. ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listi