OK, OK. I give in!
I've lifted this restriction in the HEAD.
Simon
| -Original Message-
| From: Marcin 'Qrczak' Kowalczyk [mailto:[EMAIL PROTECTED]]
| Sent: 24 February 2002 08:02
| To: [EMAIL PROTECTED]
| Subject: Re: constraints inside classes
|
|
| Fri, 22 Feb 2002 12:55:13
I get the following error when asking for the type of `build' in ghci,
5.02.2. This still happens, with or without -fglasgow-exts.
astrocyte:compiler$ ghci
___ ___ _
/ _ \ /\ /\/ __(_)
/ /_\// /_/ / / | | GHC Interactive, version 5.02.2, for Haskell
98.
/ /_\\/ __ /
Some programs work, including green-card and some HOpenGL programs.
GHC, compiled with my registerized version, crashes.
At some point, there is pointer on the Stg Stack that points into data space.
However, it doesn't point to a closure. In points to a place just
after the last data symbol in
When I compile a program using GHC 5.02.2 on Windows 200 using HGL, using
the following command line:
ghc --make HelloWorld.hs -o HelloWorld.exe -package concurrent -package
win32 -ic:\GraphicsLibrary\lib\win32
it compiles fine, but then when I run the exe, the window starts out
initially as
Artem Alimarine asks:
GHC 5.0.3 supports rank-n polymorphism.
Could anyone please point me to a paper that describes type inference
algorithm used.
Putting Type Annotations To Work, Martin Odersky and Konstantin Läufer.
In Proceedings, 23rd ACM Symposium on Principles of Programming Languages,
| So I would claim that these two types are the same:
|
| forall x. Class x = (forall y. Class y = y - y) - x - x
| (forall y. Class y = y - y) - (forall x. Class x = x - x)
|
| ...so you should be able to do this:
|
| combinator :: (forall y. Class y = y - y) - (forall x.
| Class x = x
Mark Shields and I are writing a paper. The technical
basis is in Putting type annotations to work Odersky/Laufer,
POPL'96.
Simon
| -Original Message-
| From: Artem S Alimarine [mailto:[EMAIL PROTECTED]]
| Sent: 07 March 2002 16:27
| To: [EMAIL PROTECTED]
| Subject: rank-n
On Friday 08 March 2002 01:52, you wrote:
Andre W B Furtado writes:
| Of course, it is possible to do something like
|
| update :: MyType - Int - MyType
| update mt newValue = MT {x = newValue, y = oldValue}
| where oldValue = y mt
|
| but this really annoys me when MyType
Title: [E-CFP] WFLP2002 - deadline is
approaching
Dear Colleague
I would like to remind you that the WFLP 2002 paper submission
deadline is
approaching. WFLP 2002 is the 11th
international workshop on functional and (constraint) logic
programming. WFLP 2002 aims to bring together researchers
Simon Peyton-Jones wrote:
In fact GHC does forall-lifting on type signatures to bring the
foralls to the front. But there's a bug in 5.02's forall-lifting...
...
Perhaps you can try the 5.03 snapshot release?
Certain things work there.
In fact, it is fascinating.
But now I did a new
When I compile a program using GHC 5.02.2 on Windows 200 using HGL, using
the following command line:
ghc --make HelloWorld.hs -o HelloWorld.exe -package concurrent -package
win32 -ic:\GraphicsLibrary\lib\win32
it compiles fine, but then when I run the exe, the window starts out
initially as
To : Mr. Frank A.
Chrishtoph[EMAIL PROTECTED]
I am recently doing my assignment on Haskell at my
college. I am just new on Haskell programming. I
would like to request if you can teach me for just few
programming rules on Haskell. It is my most
appreciation to learn from you.
My assignment
David Feuer [EMAIL PROTECTED] writes:
Sorting is probably easiest if you use the standard sort function. I'm
still kind of interested in whether anyone has done work on which
purely-functional sorts are efficient, and particularly which ones are
efficient in GHC.
I've implementing a
13 matches
Mail list logo
