Hi,
When I compile a HEAD version from this morning with GHC 5.02.2, there is
a deprecated warning for the use of 'tryAllIO' by
compiler/rename/RnHiFiles.lhs.
But when I compile it with a HEAD version, it gives an error and says that
Exception doesn't export 'tryAllIO' any more. When I replace
When I compile a HEAD version from this morning with GHC
5.02.2, there is
a deprecated warning for the use of 'tryAllIO' by
compiler/rename/RnHiFiles.lhs.
But when I compile it with a HEAD version, it gives an error
and says that
Exception doesn't export 'tryAllIO' any more. When I
If got the mangler to produce working code at least in some cases - I
still have to chase after a segfault in one larger program that I
tried to compile.
That's great news!
Due too my lack of Perl knowledge, I didn't yet manage to remove the
jumps from the slow to the fast entry points,
I'm trying to build ghc 5.02.2 under cygwin (2.125.2.10), using gcc
rather than an existing Haskell compiler. I'm running with gnu make
version 3.79.1
I configured with --prefix=D:/haskell/ghc (where I've installed the
package), and --enable-win32-dlls.
The make process is failing
Warning
Unable to process data:
multipart/mixed;boundary==_NextPart_000_00E0_11B85D5D.A2864B31
I just saw someone misusing [EMAIL PROTECTED]
for bug reports. I am going to join especially
- it is a funny one,
- the bug hasn't been fixed since Sep. 2001,
- it is not even put in the list of known bugs since then.
---
The following
Dear all,
After intensive investication of several people here at
Utrecht University, these are the results
1. The very latest Hugs version doesn't have the bug
2. All before-december-2001 versions don't have the bug
I were using a version downloaded some weeks ago. After
installing the
Dear all,
After intensive investication of several people
at Utrecht University, these are the results:
1. The very latest Hugs version doesn't have the bug
2. All before-december-2001 versions don't have the bug
I were using a version downloaded some weeks ago.
After installing the current
In Haskell type aliases are not allowed in instance definitions. Is
there a particular reason for this? For example, is there a problem with
type inference?
I noticed that when composing monads (in the Moggi/Wadler style) one
easily ends up with a cascade of coercions enforced by datatype
Title: new version of Parser Combinators and Syntax
Macros's
At:
http://www.cs.uu.nl/groups/ST/Software/UU_Parsing
you will find the latest/greatest version of our combinators,
that are:
- faster (faster than Parsec)
- correct much faster
- compute results lazily, and produce error messages
Dear all,
GHC 5.0.3 supports rank-n polymorphism.
Could anyone please point me to a paper that describes type inference
algorithm used.
Thanks in advance
Artem Alimarine
___
Haskell mailing list
[EMAIL PROTECTED]
On Thursday 07 March 2002 08:26 am, you wrote:
Dear all,
GHC 5.0.3 supports rank-n polymorphism.
Could anyone please point me to a paper that describes type inference
algorithm used.
The main paper is Putting Type Annotations to Work by Odersky and Laufer:
Someone already sent you the Odersky paper, but in brief, there is no
type inference (as it is undecidable). Rank-n polymorphism can only
happen via explicit type signatures. My understanding is that if these
type signatures are not there, GHC will automatically lift all the foralls
to the
GHC 5.0.3 supports rank-n polymorphism.
Could anyone please point me to a paper that describes type inference
algorithm used.
Rank-n polymorphism can only happen via explicit type signatures.
SPJ and I are working on a formal description of how all of this
works, and should have a
Dear Sir/Madam,
I am considering implement a system using Haskell. I
need to use database to manage data there. How can I
access the data records in database from Haskell?
Thanks for your advice!
Best Regards,
Dianne
__
Do You Yahoo!?
Try FREE
If I have:
data MyType = MT {
x :: Int,
y :: Char
}
How do I update the Int value of MyType leaving the Char value unaffected? I
tryied something like:
MT {x = newValue}
but GHC gave me a warning about the Char value and it indeed caused strange
effects. Of course, it is
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 has too many fields. Suggestions?
update mt
Another question about labelled types, this time concerning about
efficiency: is there any efficiency differences between functions f and g
below?
data RType = R Int Char
data Stype = S {x :: Int, y :: Char}
f :: RType - Int
f (R x _) = x
g :: SType - Int
g s = x s
Thanks again,
--
Hello!
On Fri, Mar 08, 2002 at 12:52:58AM -0300, Andre W B Furtado wrote:
Another question about labelled types, this time concerning about
efficiency: is there any efficiency differences between functions f and g
below?
data RType = R Int Char
data Stype = S {x :: Int, y :: Char}
f
Dear Sir/Madam,
I am considering implement a system using Haskell. I
need to use database to manage data there. How can I
access the data records in database from Haskell?
Thanks for your advice!
Best Regards,
Dianne
__
Do You Yahoo!?
Try FREE
On Fri, Mar 08, 2002, Ketil Z. Malde wrote:
I don't think it's either functional nor imperative by itself. The
question is how you structure it, do you say something like
buffer x
list y
x = readFile ...
y = parse x
quickSort y
print y
21 matches
Mail list logo
