Dear GHC,
Sorry for the ignorance, just two questions on 4-08-notes.sgml.
Result type signatures now work.
[..]
Constant folding is now done by Rules
What do these two mean, or where they are explained?
Maybe, you can give an example?
--
Sergey Mechveliani
[EMAIL
I get the following compile error:
(My configuration is Linux kernel 2.4.0-test1, gcc 2.91.66 and
ghc 4.06 installed)
PWD = /home/gemi/fptools/ghc/lib/std
rm -f PrelBase.o ; if [ ! -d PrelBase ]; then mkdir PrelBase; else
Lennart Augustsson wrote:
By definition, if you follow the standard you can't be wrong. :)
But the standard can be wrong. Perhaps this is a typo in the report?
I think I looked at this a while back. The standard is kaput. It gets even
worse if you try to make sense of the definitions of succ
PRELIMINARY PROGRAM
PPDP 2000
2nd International Conference on
Principles and Practice of Declarative Programming
Montréal, Canada
September 20-22, 2000
Lennart Augustsson wrote:
By definition, if you follow the standard you can't be wrong. :)
But the standard can be wrong. Perhaps this is a typo in the report?
I think I looked at this a while back. The standard is kaput. It gets even
worse if you try to make sense of the definitions of succ
Michael Weber writes (on the ghc-users list):
I'm slightly puzzled about the definition of list enumerations in
GHC (and possibly other Haskell implementations)...
``[0.0, 2 .. 9] :: [Float]''
== [0.0, 2.0, 4.0, 6.0, 8.0, 10.0]
Nevertheless, this behaviour is defined by the
[EMAIL PROTECTED] wrote:
Michael Weber writes (on the ghc-users list):
I'm slightly puzzled about the definition of list enumerations in
GHC (and possibly other Haskell implementations)...
``[0.0, 2 .. 9] :: [Float]''
== [0.0, 2.0, 4.0, 6.0, 8.0, 10.0]
Nevertheless, this