Hi
To see at a glance the various bug reports about fromJust you can
search the bug database:
http://bugs.darcs.net/[EMAIL
PROTECTED]&@sort=activity&@group=priority&@search_text=fromJust
I count 7 bugs.
I would be interested to see the results of static analysis tools
(Catch?) or applying O
At Sat, 18 Nov 2006 00:44:32 +,
Neil Mitchell wrote
> One advantage you probably haven't thought of is the size of the
> binary. Currently GMP adds about 50Kb on to the Yhc runtime, for what
> in the most cases is probably an occasional addition. If the bytecode
> for a bignum library was less
Hi
- do all those who want to distribute binaries, but not dynamically
linked, need bignums?
- it would be nice to know just how far off a good haskell version
would be performance-wise..
- what would be a killer for numerical programming, might still be
quite acceptable for a substa
claus.reinke:
> it seems that haskell versions of bignums is pretty much gone from
> more recent discussions of gmp replacements. now, I assume that
> there are lots of optimizations that keep gmp popular that one wouldn't
> want to have to reproduce, so that a haskell variant might not be
> compe
it seems that haskell versions of bignums is pretty much gone from
more recent discussions of gmp replacements. now, I assume that
there are lots of optimizations that keep gmp popular that one wouldn't
want to have to reproduce, so that a haskell variant might not be
competitive even if one had
On Fri, Nov 17, 2006 at 11:29:22PM +, Manuel M T Chakravarty wrote:
> We may want to propose to change that for Haskell'. What do you think?
indeed. that would be great. I was going to suggest dropping the
constructor constraints on the Array and Ratio data types too. is that
still advisable?
On Nov 17, 2006, at 5:40 PM, Duncan Coutts wrote:
I'd certainly support that. Am I right in thinking that it'd allow
Data.Set to be made an instance of Monad, because the Ord constraint
would be available in the body of the bind method?
return is still a problem, because there is no Ord constra
On Fri, 2006-11-17 at 23:29 +, Manuel M T Chakravarty wrote:
> > This feature has been often requested, becuase it allows you to
> > package a dictionary into an ordinary (non-existential) data type, and
> > be able to use it.
> >
> > NOTE: the Haskell 98 syntax for data type declarations
> >
Simon Peyton-Jones wrote:
> 3. Dictionaries are packaged in data constructors
> ~~
> A very useful new feature is this. When a data type is declared in in
> GADT syntax, the context of the constructor is
> *required* when constructing
> *available* when
One of the people experiencing this sent me some sample code, and now
I can reproduce it too, on both PPC and Intel.
I would guess that there is an issue with the way shared library
loading works in interactive mode, as opposed to in the link phase
when compiling.
You can work around the
John
Sorry for slow reply . It's been a busy week.
| but I am still having a couple issues:
|
| I am having trouble with a couple foreign imports that I think
| should work:
|
| here is one:
|
| > type World__ = State# RealWorld
| >
| > main = IO $ \w -> case getchar w of
| > (# w', ch #) -
It's in Debian unstable. You can get it from there.
Chad Scherrer wrote:
Is there a preferred way of getting this going? I tried the GHC
instructions for Debian, but this seems to depend on 6.6 already being
in the repository, which it's not, in Ubuntu (why?).
I like Debian/Ubuntu's install sy
Hello Simon,
Tuesday, November 14, 2006, 1:19:45 PM, you wrote:
>> i still forget to ask: if my program is idle during long time, is GC
>> will occur each 0.3 seconds or GHC is smart enough to check that no
>> much memory was allocated after last GC?
> You'll only get one GC. Or at least that's
Is there a preferred way of getting this going? I tried the GHC
instructions for Debian, but this seems to depend on 6.6 already being
in the repository, which it's not, in Ubuntu (why?).
I like Debian/Ubuntu's install system, and I assume that 6.6 will
eventually make it into Ubuntu. I want to b
Am 16.11.2006 um 13:33 schrieb Tomasz Zielonka:
On Wed, Nov 15, 2006 at 01:20:43PM +0100, Jan Christiansen wrote:
I would work, if you used existential quantification, but I am don't
know if it would be what you want:
data Test = forall a . Test [a -> a]
I don't know why you current code doe
15 matches
Mail list logo
