On Tue, 30 Dec 2003 23:14:05 +0100, Wolfgang Jeltsch
[EMAIL PROTECTED] wrote:
[replying indirectly because the original email doesn't seem to have
gotten here yet]
I have an algorithm which updates one or more arrays in a loop. The
update operations depend on the (old) contents of the
Am Mittwoch, 31. Dezember 2003 00:06 schrieb Daan Leijen:
Hi Wolfgang,
is there some documentation about the complexity of the FiniteMap and Set
operations?
[...]
The operations in the Data.FiniteMap library in Ghc have the same
complexity of the operations in the DData.Map library. The
On Tue, Dec 30, 2003 at 10:31:57PM -0500, [EMAIL PROTECTED] wrote:
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
On Wed, 31 Dec 2003 12:35:23 +0100, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
The documentation of DData.Map states the following as an advantage of
DData.Map over Data.FiniteMap:
It uses the efficient hedge algorithm for both union and difference [...].
Does this mean that the Data.FiniteMap
Hello,
Haddock 0.6 produces output where code generated from non-comment source (like
the declarations in the synopsis) is not split across multiple lines. Since
my type declarations are rather long, the Haddock-produced lines get much
larger than my screen when shown in a web browser. How
Hello,
I have a datatype
Relation element1 element2
which derives an Eq instance. In the Haddock-generated documentation the
instances section of Relation says
(Ord element1, Ord element2, ??? element1 element2) = [...].
Why does Haddock generate this mysterious
??? element1
Wolfgang Jeltsch wrote:
[...] How can I make Haddock split these lines and maybe even indenting lines
to produce a nice layout? The documentation of the hierarchical libraries
seems to use an automatic line breaking feature.
There have been some small changes after Haddock 0.6 was released,
Am Mittwoch, 31. Dezember 2003 17:48 schrieb Sven Panne:
Wolfgang Jeltsch wrote:
I have a datatype
Relation element1 element2
which derives an Eq instance. In the Haddock-generated documentation the
instances section of Relation says
(Ord element1, Ord element2, ??? element1
afaik, this is fine. in fact, i use this idiom very frequently, so if
it's bad, i've never seen the badness of it.
On Tue, 30 Dec 2003, John Meacham wrote:
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
G'day all.
Quoting Tomasz Zielonka [EMAIL PROTECTED]:
OK. I think I may be getting it now. The point is that MonadCont takes
care of passing the continuation, so you don't have to do it by hand. Is
that right?
Precisely.
Happy New Year,
And to you and yours.
Cheers,
Andrew Bromage
On Tue, 30 Dec 2003 11:24:01 +0100
Gour [EMAIL PROTECTED] wrote:
Derek Elkins ([EMAIL PROTECTED]) wrote:
Add -v and see what's going on, make sure everything seems right.
Failed: C:\GHC\GHC-6.2\gcc -BC:\GHC\GHC-6.2\gcc-lib/ -I. -I. -c
c:\windows\tem p\ghc-511675.s -o main.orawSystem:
Derek Elkins ([EMAIL PROTECTED]) wrote:
It looks like it's saying that it couldn't find the gcc that should be
at c:\ghc\ghc-6.2
I was searching a little bit in the lists' archives and found the following
message:
http://haskell.org/pipermail/glasgow-haskell-users/2003-October/005822.html
Bugs item #753780, was opened at 2003-06-13 07:24
Message generated for change (Settings changed) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=753780group_id=8032
Category: Compiler (Type checker)
Group: None
Status: Closed
Resolution:
Bugs item #865518, was opened at 2003-12-24 22:09
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=865518group_id=8032
Category: Compiler
Group: None
Status: Closed
Resolution: Invalid
Priority: 5
Bugs item #820778, was opened at 2003-10-09 17:51
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=820778group_id=8032
Category: Compiler (Type checker)
Group: 6.0.1
Status: Closed
Resolution:
Simon Peyton-Jones ([EMAIL PROTECTED]) wrote:
There's something very mysterious going on. GHC does not depend on you
having any particular version of gcc etc; it all comes in the bundle.
Are you absolutely certain that you made no change at all to the
installed binaries? Such as removing
In GHC 6.2, Template Haskell has various bugs. I think they are all
fixed in the HEAD, so you can either build from source or grab a
development snapshot from the GHC site.
The HEAD version of TH has a slightly different programming interface
too -- see
Hello again,
I've tried the simplest possible reference counting approach which should
be OK if all finalisers are run eventually (as I think is the case currently
with ghc 6.2).
But I don't seem to be able to get it to work. I've attached the library
reference counting code (LibRef module) to
I've read 4 messages following this, but I'd like to pursue this a little
to test my own understanding...
At 14:12 30/12/03 +, Joe Thornber wrote:
I was wondering if anyone could give me some help with this problem ?
I'm trying to hold some state in a StateMonad whilst I iterate over a
On Wed, Dec 31, 2003 at 11:54:27AM +, Graham Klyne wrote:
My *intuition* here is that the problem is with countLeaves2, in that it
must build the computation for the given [sub]tree before it can start to
evaluate it. Maybe this is why other responses talk about changing the
state
At 12:36 31/12/03 +, Joe Thornber wrote:
On Wed, Dec 31, 2003 at 11:54:27AM +, Graham Klyne wrote:
My *intuition* here is that the problem is with countLeaves2, in that it
must build the computation for the given [sub]tree before it can start to
evaluate it. Maybe this is why other
On Wed, Dec 31, 2003 at 02:38:06PM +, Graham Klyne wrote:
getOrCachePositionValue pos =
do { mcache - gets (findPos pos) -- Query cache for position
; case mcache of
Just cached - return (cachedVal cached) -- Return cached value
Nothing -
Hi,
Can anyone explain to me how hugs manages to derive that
f x y z = y (y z) x
is of type
f :: a - ((a - b) - a - b) - (a - b) - b
Many thanks and a happy new year to all!
Lee
_
Stay in touch with absent friends - get MSN
On 2003-12-31 at 19:27GMT Lee Dixon wrote:
Hi,
Can anyone explain to me how hugs manages to derive that
f x y z = y (y z) x
is of type
f :: a - ((a - b) - a - b) - (a - b) - b
To begin with, f has three arguments, x y and z, so letting
each of these have types Tx Ty and Tz, f has to
Omitting the typeclass bit, I'm trying to write something like
(s1 - s2) - StateT s1 m () - StateT s2 m a - StateT s1 m a
That is, it sequences two StateT computations, providing a way to
translate from the first's state to the second to keep the chain
going.
I can easily write something for
I tried posting this before but, from my point of view, it vanished. My
apologies if it's a duplicate.
In http://www.cs.uu.nl/~daan/download/parsec/parsec.html we read,
testOr2 = try (string (a))
| string (b)
or an even better version:
testOr3 = do{ try (string (a); char ')';
Mark,
I'm no expert, but does it help to start from withStateT?
withStateT :: (s - s) - StateT s m a - StateT s m a
withStateT f m = StateT $ runStateT m . f
There are some notes about computations and lifting
state transformers in
Modular Denotational Semantics for Compiler Construction
Mark Carroll [EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.cafe:
Omitting the typeclass bit, I'm trying to write something like
(s1 - s2) - StateT s1 m () - StateT s2 m a - StateT s1 m a
That is, it sequences two StateT computations, providing a way to
On Wed, 31 Dec 2003, Ken Shan wrote:
Don't you need a (s2 - s1) function as well, to translate the final
state back into StateT s1?
Yes, you're right: the thing actually running the stateful computation
presumably expects to start it with a state of type s1 and to be able to
extract from it a
29 matches
Mail list logo
