We're wondering here whether we should push out 5.04.2
soon, or wait a
while and see what other bugs turn up.
Opinions, anyone?
Release often, release soon! Why not put out a source distribution
on a regular basis, say, every month or so (I realize that binary
distributions are a
Martin Sjögren wrote:
I have a problem with Data.Dynamic. The problem is probably that I don't
understand it. From my understanding, the following program should work:
-8
import Data.Dynamic
data Foo = Foo { x :: Int }
deriving Show
instance Typeable
Simon Marlow wrote:
| [...] and in any case binary packages always pop out
| of the end of the nightly build, so building them
| isn't any extra hassle.
:
| So I think the current situation is a good compromise:
| those who want the bleeding edge can get CVS and watch
| [EMAIL PROTECTED]
http://galois.com/~sof/ghc/nightly/dist/
is one such place (src + RH7.3 tar bundles)...well, it
will (again) be once the sysadmin wakes up! (directory
indexing on the web server has been shut off for some
reason.)
--sigbjorn
- Original Message -
From: Koen Claessen [EMAIL PROTECTED]
Dear Haskell people,
when I call from Haskell into C, stop it there, and use a debugger (e.g
gdb) to look at the stack, it looks all broken. Here is an example:
#0 c_init () at c.c:5
#1 0x08048f14 in ssM_fast1 ()
#2 0x0804a248 in sakt_ret ()
#3 0x04c58308 in ?? ()
(c_init is a C function
when I call from Haskell into C, stop it there, and use a
debugger (e.g
gdb) to look at the stack, it looks all broken. Here is an example:
#0 c_init () at c.c:5
#1 0x08048f14 in ssM_fast1 ()
#2 0x0804a248 in sakt_ret ()
#3 0x04c58308 in ?? ()
(c_init is a C function on which
| Duplicate instance declarations:
| ../tools/base/lib/Monads/ExceptM.hs:26: Functor (Either x)
| No locn: Functor (Either e)
Yes, this is bad. The HEAD reports the module which defined the
instance:
Inst.hs:3:
Duplicate instance declarations:
Inst.hs:3: Eq [a]
In module
What about the Core interpreter in fptools/ghc/utils/ext-core ?
There's a Happy parser source file there, Parser.y, as well as
all sorts of other Core-related goodies.
FYI, one can use the parser and printer in fptools/ghc/utils/ext-core as
is, but the typechecker and interpreter need
|
| It's inconsistent to remove the +1/2 for numericEnumFromTo but to
leave
| the +(n'-n) for numericEnumFromThenTo. I think you probably mean to
| remove both (actually, all three).
|
| I wouldn't recommend these changes for Float and Double (the
increments
| are there to account for
| I definitely can't do that at this stage. I have never liked
| Float/Double/Ratio being in Enum, but there is no possibility of
| removing them now. A year or two ago, maybe.
|
| Just to clarify: Did you mean for Haskell 98 or did you mean forever?
Thanks for raising that
I
George Russell [EMAIL PROTECTED] writes:
The situation with Enum on Ratio is pretty bad but at least
it's not hopeless, since rational numbers are at least exact. But
for Float/Double it seems to be a total disaster area.
My vote would be to scrap it. Enum sounds like it defines an
Ketil Z Malde [EMAIL PROTECTED] writes:
My vote would be to scrap it. Enum sounds like it defines an ordering
of elements, and that's IMHO not what the actual implementation looks
Just before everybody else points it out; that's a bit imprecise.
But the IMHO obvious way to regard succ would
Not just a few haskell@... subscribers
do transformation for/with functional programming.
Thanks for passing on to interested authors.
--
Ralf Laemmel
VU CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
Special Issue on Program Transformation
Science of
Ketil Z Malde wrote:
George Russell [EMAIL PROTECTED] writes:
The situation with Enum on Ratio is pretty bad but at least
it's not hopeless, since rational numbers are at least exact. But
for Float/Double it seems to be a total disaster area.
My vote would be to scrap it. Enum
I try the follow line in hugs (mode 98 enable)
Prelude :t (let f = \x - x == x in ( f 'a', f 123 ) )
ERROR: Illegal Haskell 98 class constraint in inferred type
*** Expression : let {...} in (f 'a',f 123)
*** Type : Num Char = (Bool,Bool)
Prelude
This happend because Num Char can never be
Alejandro Russo wrote:
I try the follow line in hugs (mode 98 enable)
Prelude :t (let f = \x - x == x in ( f 'a', f 123 ) )
ERROR: Illegal Haskell 98 class constraint in inferred type
*** Expression : let {...} in (f 'a',f 123)
*** Type : Num Char = (Bool,Bool)
Prelude
This
16 matches
Mail list logo
