Hi,
In ghc 6.4 using -M mode it appears to be stricter when parsing the
files looking for dependencies. In particular importing things with '#'
suffixes eg:
import GHC.Really.Really.Internal.Dont.Touch (unsafeNastyThing#)
did not require the -fglasgow-exts option. In ghc 6.4 it does require
Bugs item #1035575, was opened at 2004-09-27 16:33
Message generated for change (Comment added) made by chak
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1035575group_id=8032
Category: Compiler
Group: None
Status: Closed
Resolution: Fixed
Priority: 4
There may be many loaded modules... What if they have contradictory
flags
And in fact GHC doesn't remember in interface files the flag settings
with which was compiled. Perhaps it should, but it doesn't at the
moment.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
This crash is fixed, in the HEAD and 6.4. It turned out to be a
desugaring bug involving existentials etc.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:glasgow-haskell-users-
| [EMAIL PROTECTED] On Behalf Of Akos Korosmezey
| Sent: 18 February 2005 20:05
| To: GHC-users
On Thu, 2005-03-03 at 12:12 +0100, Marcin 'Qrczak' Kowalczyk wrote:
I was thinking about integration with gtk/glib event loop.
Yes please!
Currently GUI libs (gtk2hs, wxHaskell, fltk, etc) cannot use threads in
any sensible manner.
I think think there are two problems with this. One is that
Benjamin Franksen wrote:
This is extremely cool. The type of unwrap is indeed general enough.
Unfortunately, it doesn't help, because the result type of wrap
Wrap (forall a. a - a)
still isn't accepted in an instance declaration. Neither is the pair
(unwrap, Wrap (forall a. a - a))
Or maybe I
Scott Turner [EMAIL PROTECTED] writes:
Is the behavior of evaluating z unspecified?
z = f (0, z)
f x = case x of
(1,1) - z
_ - 0
Hugs and GHC agree that z evaluates to 0. However, if the first line is
changed to
z = f (z,0)
then both implementations loop. In other words, the
Hello,
for my diploma thesis, I need to find information about integration of
functional and imperative programming concepts. Could somebody of you point
me to good websites, papers, etc. about this topic?
Thanks a lot.
Best wishes,
Wolfgang
___
Hello,
for my diploma thesis, I need to find information about integration of
functional and imperative programming concepts. Could somebody of you point
me to good websites, papers, etc. about this topic?
Tackling the Awkward Squad
and
State in Haskell
both probably on Simon Peyton
Happily, with GHC 6.4, your code works fine, both with 'deriving' and
with a hand-written instance.
It works because 6.4 can build recursive dictionaries.
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Shin-Cheng
| Mu
| Sent: 14 February 2005
On Wed, Feb 16, 2005 at 12:38:45PM -, Simon Marlow wrote:
On 16 February 2005 08:08, Ralf Laemmel wrote:
Assoc types and GADTs are great but
I am still too fond of encoding extensible datatypes with (open)
classes.
I contributed to some related discussion at comp.compilers a while
Is there any practical way to do client-side web scripting in
Haskell? All the references I have found to HaskellScript seem quite
out of date.
Dean
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Wolfgang Thaller [EMAIL PROTECTED] writes:
Indeed, my brain is melting, but I did it :-)
Congratulations. How about we found a Bound-thread-induced brain
melt victims' support group?
The melt was entertaining :-)
Besides simplicity, one of the main reasons for moving our select()
call
{-
I have written a program (below) to run a test suite for a list of functions:
[isTotalJunc, isPartialJunc]
where each function receives a datum of type ApplyArg whose value slot is
one element at a time of the list of types below:
[JNone, JOne, JAny, JAll]
I therefore must run 8
Am Donnerstag, 3. März 2005 14:28 schrieb Terrence Brannon:
{-
I have written a program (below) to run a test suite for a list of
functions:
[isTotalJunc, isPartialJunc]
where each function receives a datum of type ApplyArg whose value slot is
one element at a time of the list of types
[moving to the cafe]
On Thu, Mar 03, 2005 at 09:39:17AM -0500, Scott Turner wrote:
Is the behavior of evaluating z unspecified?
z = f (0, z)
f x = case x of
(1,1) - z
_ - 0
Hugs and GHC agree that z evaluates to 0. However, if the first line is
changed to
z = f (z,0)
then both
Am Donnerstag, 3. März 2005 14:28 schrieb Terrence Brannon:
{-
I have written a program (below) to run a test suite for a list of
functions:
[isTotalJunc, isPartialJunc]
where each function receives a datum of type ApplyArg whose value slot is
one element at a time of the list of types
Peter Simons told me that someone has written a DNS resolver in
Haskell that doesn't rely on an FFI call. I'd love to look at it if
it is available...
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
Thaks a lot for your contribution, this helps me a lot, I see what I've got to do.
However, I understand the first version (Stack.hs), but I can't get what StateM.hs is. Is
it the same version but using state transformers, so as to be able to do IO (which I would
need)? In fact, could you give
19 matches
Mail list logo
