Bugs item #782761, was opened at 2003-08-04 04:32
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=782761group_id=8032
Category: hslibs/text
Group: None
Status: Open
Resolution:
I have run into something in GHC that looks
like a bug (GHC 6.0.1 under Win2k). A DLL with several exported
FFI functions reports (and then terminates):
ghcDll: internal error: schedule: invalid what_next field
Please report this as a bug to [EMAIL PROTECTED],
or
One of GHC's infelicities is that it only supports tuples up to a
certain size -- currently 62.
You just can't get bigger tuples. Your program uses a 73-tuple. My
guess is that your code is generated by some other program that's
generating big tuples?
The only workaround is to nest your tuples.
The code is hand-written and the maximum tuple-size
used is 4. It works fine in Hugs. It uses the Parsec
library (not the version in GHC's text package, but
from a local copy. The ParsecPrim.hs was replaced by
the version from Parsec's web-site -- it works as I
expected, but not the one
Hello,
I am experimenting with GHC to write low level code (e.g., device
drivers, interrupt handlers). The ultimate goal is to write a
prototype operating system in Haskell, using the GHC RTS as a kind of
microkernel (this appears to be relatively easy by removing all the
dependencies on an
On Wed, Jul 30, 2003 at 01:06:02PM +0100, Simon Marlow wrote:
=
The (Interactive) Glasgow Haskell Compiler -- version 6.0.1
=
We are pleased to announce a new
The ultimate goal is to write a
prototype operating system in Haskell, using the GHC RTS as a kind of
microkernel
As a useful stepping stone towards that goal, you might look at Utah's OSKit:
http://www.cs.utah.edu/flux/oskit/
It gives you a bunch of useful bits like bootloaders, device
In article [EMAIL PROTECTED],
Ian Lynagh [EMAIL PROTECTED] wrote:
Debian packages are now in the archive for unstable; just apt-get
update and apt-get install ghc6 ghc6-prof ghc6-doc. There are also
ghc6-hopengl, ghc6-threaded-rts and ghc6-libsrc packages. It should
enter testing in 10 days
On Mon, Aug 04, 2003 at 02:11:19PM -0700, Ashley Yakeley wrote:
In article [EMAIL PROTECTED],
Ian Lynagh [EMAIL PROTECTED] wrote:
Debian packages are now in the archive for unstable; just apt-get
update and apt-get install ghc6 ghc6-prof ghc6-doc. There are also
ghc6-hopengl,
Ben Rudiak-Gould wrote:
[...]
The final straw was:
Prelude let ?x = 1 in let g = ?x in let ?x = 2 in g
1
Prelude let ?x = 1 in let g () = ?x in let ?x = 2 in g ()
2
This is insanity. I can't possibly use a language feature which
behaves in
such a non-orthogonal way.
Well, this is
Does anyone know if Haskell is/was used to develop educative games? Do you
recommend some papers on the subject?
Thanks a lot,
-- Andre Furtado
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
==
SECOND CALL FOR PAPERS
CLIMA IV
Fourth International Workshop on Computational Logic in Multi-Agent Systems
On Wed, Jul 30, 2003 at 01:06:02PM +0100, Simon Marlow wrote:
=
The (Interactive) Glasgow Haskell Compiler -- version 6.0.1
=
We are pleased to announce a new
Trouble for implicit parameter defaults: consider
?foo = 0
let x = ?foo in
(x + ?foo) { ?foo = 1 }
This evaluates to 1 when the monomorphism restriction is turned on, and 2
when it's off. This is no worse than the current behavior of implicit
parameters even without
On Sat, Aug 02, 2003 at 10:35:34AM -0300, Andre W B Furtado wrote:
Does anyone know if Haskell is/was used to develop educative games? Do you
recommend some papers on the subject?
Oddly enough, I wrote a version of letter invaders (to teach typing) for
haskell using HSHGL and HSX11 the other
At 2003-08-03 14:09, Ben Rudiak-Gould wrote:
This reduction is incorrect. Auto-lifted parameters on the RHS of an
application get lifted out
I am interpreting this as Auto-lifted parameters on the RHS of an
application get lifted out before [EMAIL PROTECTED] 'beta'-reduction can be
done. I
At 2003-08-04 18:19, Ben Rudiak-Gould wrote:
[EMAIL PROTECTED] - ((\a - ((a,[EMAIL PROTECTED] - @x) [EMAIL PROTECTED] =
2})) @x)
If we next apply (\a - ...) to @x, something interesting happens: we
have to rename to avoid variable capture.
I don't see why, isn't this much the same as
At 2003-08-04 20:00, Ben Rudiak-Gould wrote:
This is a different lambda calculus, with a different beta rule. You can
see the same effect in the type inference rules for implicit parameters:
If f has type Int - String and ?x has type (?x :: Int) = Int, then f ?x
has type (?x :: Int) = String,
Hi all, I am using parsec to parse the output from xmame -listinfo
wich is a list of records of the form
game (
attr1 value1
...
attrN valueN
)
and for approx. 3500 records I got ~250 mb of RSS memory during parsing,
wich takes 20 seconds on my athlon 1400.
I think that I must have
Is there someone who has implemented some limited form of persistency in
haskell? I don't mean the longly-debated persistence of functional
values, but something rough, like a persistent MVar with a thread saving
modified values every n seconds or so.
Vincenzo
BINGO NETHERLANDS SWEEEPSTAKE LOTTERY NL
BURDENSTRAAT21B
1053 DS AMSTERDAM, THE NETHERLANDS
that is exactly what I implemented in ginsu
http://repetae.net/john/computer/ginsu/
an MVar contains the current puff history, which s dumped to disk
periodically if it has changed since the last dump, it relys on using
DrIFT to derive a Binary instance for [Puff] and concurrency to spawn
off a
Haskellers,
I'm currently working on my first Haskell program. I really like the
language so far, though it has been hard to break the OO frame of mind.
Normally, I'm a C++/Perl programmer, but I have really enjoyed the
type-safety of Haskell over Perl as well as the Hugs interpreter over a make
On Mon, 4 Aug 2003 14:55:18 -0700
John Meacham [EMAIL PROTECTED] wrote:
an MVar contains the current puff history, which s dumped to disk
periodically if it has changed since the last dump, it relys on using
DrIFT to derive a Binary instance for [Puff] and concurrency to spawn
off a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I don't see that the contibutors files are fundementally different.
- From what I understand, it should be possible to write a
generic function,
importCSV :: FilePath - IO [ (String,String) ]
where the 1st value is a field name and the 2nd
25 matches
Mail list logo
