Simon Peyton-Jones wrote:
The coverage condition is described in the paper
http://research.microsoft.com/~simonpj/papers/fd-chr
Use -fallow-undecidable-instances to make it compile.
Thanks, it seems to compile now. I've had a quick look at
the paper you mentioned and I also see the latest ghc
hi,
is there some command line switch in GHC that would allow me to see
context reduction steps during the compilation?
Thanks,
Misha
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
-ddump-tc-trace will probably tell you too much, but that's what I use when I'm
trying to peer into GHC's innards. I have not documented its output, because I
change it every so often; you'll have to look at the source code.
A good little project would be to design a sensible output form for
No, there's no easy way (that I can see) to achieve what you want. The problem
is that the way to unpack C depends on how you instantiate 'a'. So you need a
specialised variant of the actual data constructor C, one for each
instantiation of 'a'. (Well, one for each shape of instantiation
On Dec 29, 2006, at 8:32 AM, Thorkil Naur wrote:
On Friday 01 September 2006 06:43, Peter Tanski wrote:
...
For a brief overview of the speed of the libraries I looked at
carefully, see http://hackage.haskell.org/trac/ghc/wiki/
ReplacingGMPNotes (I added a few charts to show the speed of
