> I'm curious about the implementation of Concurrent Haskell in GHC
> and Hugs.
Hugs' implementation of concurrency is non-preemptive wherease GHC's
implementation is preemptive (or "almost preemptive") as described by
Simon.
> Does access to values possibly shared among threads cost the same i
> Is there something like a Hugs plugin for Netscape?
We used to have one at Yale. Can't remember what happened to it so I'm
adding John Peterson to the address list in case he can remember.
--
Alastair ReidReid Consulting (UK) Ltd
___
Hask
> When I compile a program using GHC 5.02.2 on Windows 200 using HGL,
I don't have GHC installed on my Windows partition (nor space for it,
I suspect) so I'll ask some questions and hope they suggest an answer.
Does it work ok using Hugs and HGL?
Sigbjorn Finne did a great job of packaging
> It would be possible to do strict evaluation in the case that the
> suspended computation is known to take a small bounded amount of
> time and space and can't fail - GHC doesn't do this, but we've
> wondered about it from time to time.
I wonder if this would have the side-effect of making Has
Dean Herington:
> I strongly prefer that that behavior _not_ be provision of any
> normal Int value.
I agree.
I think a operation to let you examine the (possibly) underlying 2s
complement representation without raising an exception should be quite
separate from the operation to convert between
> Hello, I am interested in using global variables (in GHC). I need a
> variable to store list of Integers to store temporary results. I
> have been reading the module MVar, but I wonder if there is an
> alternative way of doing it. I have already implemented my function
> using an auxiliar ar
> Also, GHC's NumExts has
> doubleToFloat :: Double -> Float
> floatToDouble :: Float -> Double
> Q2: If we are going to run round adding functions to Numeric,
> should we add those too? It's hard to know where to stop... but if
> that conversion is what you want to do, H98 doesn't give
> Ah, I forgot that you can't export a constructor on its own.
You can't?
I probably knew this once but looking at it now, it seems kinda
surprising. Haskell's module system is supposed to be just namespace
control --nothing more-- so why is it preventing me from doing something
which is per
"Rijk-Jan van Haaften" <[EMAIL PROTECTED]>:
>> What does the language definition say about [tabs]?
Sigbjorn:
> Nothing at all, I believe, but the convention is [...]
The Haskell 1.4 report says what is meant to happen (section 1.5)
(which was to follow the convention).
The Haskell 98 report om
Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]> writes:
> Parsec [uses some variant of the error monad] and similar things. It
> tries to generate reasonable messages of the form "expecting foo,
> found bar" or "unexpected bar" annotated with source position,
> making use of labels of higher level
> If the GUI is based on the IO monad, then it doesn't seem like there is
> a lot of advantage to doing it in Haskell. It seems like a better
> idea to use a more natural language for IO and make RPC/interproc calls
> to a haskell server to get stuff done.
In other words, if you use the IO mon
Quick reply to just one point (more later, I hope):
> Also, do these books have good coverage of things like
> existential types, functional dependencies, other
> experimental-but-apparently-crucial features that are hard to find
> documentation for?
I consider myself a fairly hardcore Ha
I think there's a lot of truth in all you said in your message and I
make the following comment merely as a point of information.
> I think I speak for the majority of 'industrial' programmers when I
> say Haskell is a very difficult language to approach. I believe a
> great deal of this difficu
> hello, i just want to ask a simple question: does somebody have or
> know where to find a haskell program that calculates the number e,
> that is the list of infinite digits?
Hugs includes such a function in its demos.
Look at eFactBase in the file hugs98/demos/Examples.hs
There's a lot of oth
Janis Voigtlaender <[EMAIL PROTECTED]> writes:
> 2. In a '93 paper, Jan Sparud describes an implementation technique
> for avoiding space leaks when tuples are returned as function
> result, and the values accessed by pattern matching in bindings. The
> paper says this technique (of shorcircuitin
Mark Tullsen <[EMAIL PROTECTED]> writes:
> You have to realize that Alastair Reid is one of the truly great
> Haskell programmers on planet earth. I'm serious. So, when he says
> "incredibly subtle space leak" I wouldn't expect the solution to be
> simple. As far as I can tell, your argument
> I find it therefore of concern that many crucial Haskell documents,
> including the standard and, for example, the various Glasgow Haskell
> manuals, are only available online.
My printed copy of the Haskell 98 report is numbered:
YaleU/DCS/RR-1106
Copies can no doubt be obtained from the
Executive summary: David's program has an incredibly subtle space leak
in it (or I'm being incredibly dumb). I encourage the honchos (and
would be honchos) to have a look. Users of other compilers might give
it a shot too.
David Bakin <[EMAIL PROTECTED]> writes:
> Why is there a space leak i
Fergus Henderson <[EMAIL PROTECTED]> writes:
> (It would be good for someone, perhaps Simon P-J., to keep a
> list of issues like this which have been left out of Haskell 98
> due to backwards compatibility concerns, so that they don't get
> forgotten about when it comes to time for the next vers
19 matches
Mail list logo
