Bugs item #1244882, was opened at 2005-07-26 00:39
Message generated for change (Settings changed) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1244882group_id=8032
Please note that this message will contain a full copy of the comment
Basically, the pre-ghc6.4 way of doing scoped type variables breaks
down for higher-rank functions. For example
foo :: (forall a. a - b) - b
foo (f :: forall a. a - b) = f undefined :: b
is accepted by ghc-6.2 but rejected by the current ghc with an error message
Couldn't match `forall a.
Bugs item #1245266, was opened at 2005-07-26 07:05
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1245266group_id=8032
Please note that this message will contain a full copy of
Bugs item #1245266, was opened at 2005-07-26 07:05
Message generated for change (Comment added) made by sigbjorn
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1245266group_id=8032
Please note that this message will contain a full copy of the comment
Bugs item #1245266, was opened at 2005-07-26 07:05
Message generated for change (Comment added) made by sigbjorn
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1245266group_id=8032
Please note that this message will contain a full copy of the comment
Hi,
I'm fairly sure this has been asked before (and recently too), but I
can't seem to find it in the archives. Sorry for the repetition.
Is there a way I can turn garbage collection off in GHC? I'm happy to
hack the runtime and comment out code if that is the only way. I just
don't know which
Hello,
http://haskell.org/ghc/docs/latest/html/libraries/base/Control.Monad.ST.html
says about the module Control.Monad.ST:
This library provides support for strict state threads, as described in
the PLDI '94 paper by John Launchbury and Simon Peyton Jones Lazy State
Threads.
I
Thanks! It's interesting the way your AVL tree library is set up --
there seems to be a much broader degree of functionality than that
provided by Data.Set. But I'm trying to see, is there a significant
difference in the fundamental data structure, or is the main point that
the additional
Hello!
I'm a student in Professor John Peterson's Elements of Computing
(class site located here: http://cs.yale.edu/cs110-05)
and he's having me learn Haskell with Paul Hudak's SOE book. I'm
working on the PaddleBall in 20 lines at the end of Chapter 15 and I'm
having a problem with HUGS. I
On 7/27/05, Alex Edelsburg [EMAIL PROTECTED] wrote:
Hello!
I'm a student in Professor John Peterson's Elements of Computing (class
site located here: http://cs.yale.edu/cs110-05) and he's having me learn
Haskell with Paul Hudak's SOE book. I'm working on the PaddleBall in 20
lines at
Thanks for the quick reply. I rewrote import Word (word32ToInt) as
import Word (fromIntegral). It took much longer for Hugs to compile my
code (I know its technically an interpeter...) but when it finished, I
got the following error.
ERROR Animation.hs - Unknown entity fromIntegral imported
On 23 July 2005 22:52, Duncan Coutts wrote:
On Sat, 2005-07-23 at 22:49 +0200, Jan Scott wrote:
Hi,
Has anyone ever tried to build Ghc with Microsofts c compiler (msvc)
?
GHC relies quite heavily on gcc. GHC's C code backend uses a number of
GNU C extensions I believe.
I think it
On 25 July 2005 14:44, Einar Karttunen wrote:
What is the correct way to express liveness dependencies for
ForeignPtrs? I am wrapping a C library and need a way to keep
ForeignPtrs alive until the finalizer for an another ForeignPtr
has been executed.
Basically I have two types, ForeignPtr
On 25 July 2005 22:41, Sebastian Sylvan wrote:
On 7/25/05, Simon Marlow [EMAIL PROTECTED] wrote:
On 23 July 2005 03:38, Duncan Coutts wrote:
The problem then as John noted is that the main loop of these
toolkits block and so the other Haskell threads would not get a
chance to schedule. So
Simon Marlow [EMAIL PROTECTED] writes:
You might be able to find more information on this in the mailing list
archives. It's true that touchForeignPtr isn't enough to enforce an
ordering on the running of finalizers, but it *can* be used to express a
liveness relationship between one
On 26 July 2005 11:26, Einar Karttunen wrote:
Simon Marlow [EMAIL PROTECTED] writes:
You might be able to find more information on this in the mailing
list archives. It's true that touchForeignPtr isn't enough to
enforce an ordering on the running of finalizers, but it *can* be
used to
On 7/26/05, Simon Marlow [EMAIL PROTECTED] wrote:
On 25 July 2005 22:41, Sebastian Sylvan wrote:
On 7/25/05, Simon Marlow [EMAIL PROTECTED] wrote:
On 23 July 2005 03:38, Duncan Coutts wrote:
The problem then as John noted is that the main loop of these
toolkits block and so the other
On 26 July 2005 11:32, Sebastian Sylvan wrote:
On 7/26/05, Simon Marlow [EMAIL PROTECTED] wrote:
On 25 July 2005 22:41, Sebastian Sylvan wrote:
Well how about not touching the bound threads design at all, but
modifying the lightweigh threads design to also include forkIOHere
(or something)
On 26 July 2005 14:15, Einar Karttunen wrote:
Simon Marlow [EMAIL PROTECTED] writes:
Now the association becomes
associate (Foo _ ref) bar =
atomicModifyIORef ref (\lst - (touchForeignPtr bar : lst, ()))
Isn't that equivalent to using addForeignPtrFinalizer? I don't think
this fixes
Hi all,
I'm [trying to] develop a system that uses plug-ins to implement a
black-box ADT, that is a data-type and a few typeclass instances
for it. I want my system (a theorem prover) to be able to work with
any of these plug-ins (which define a logic and operations on its
formulae) but
Hello everybody,
Now I am writing a module to handles messages of a system. The
messages are stored in a file. The content of each line of the file
likes this:
1001 001 Error message 1
1001 002 Error message 2
1002
Simon Marlow [EMAIL PROTECTED] writes:
No, unfortunately not. You have foo's finalizer which refers to bar via
a touchForeignPtr. If both foo and bar are unreachable (references from
finalizers don't count), then both foo and bar's finalizers will be
started together, and may run in any
Here's how I wrote it:
- beginning of file
import IO
-- turn a line of the text file into a pair consisting of
-- the message triple and the message string
-- slight bug: will contract multiple spaces in the message string
-- This could be rewritten to avoid this problem, but couldn't make
23 matches
Mail list logo
