On 22/06/2011 17:57, Simon Peyton-Jones wrote:
> I have long advertised a plan to allow so-called superclass equalities. I've
> just pushed patches to implement them. So now you can write
>
> class (F a ~ b) => C a b where { ... }
That is fantastic. I have a question about this feature as comp
Can someone provide an example of how to use wrapFR/wrapBR? I know
they are deprecated, but I would really like to see them in action if
they are used anywhere at all ...
Thanks so much!
Justin
___
Glasgow-haskell-users mailing list
Glasgow-haskell-use
On Thu, Jun 23, 2011 at 3:27 PM, Jan-Willem Maessen
wrote:
> Yes, I'd still expect that; internal node churn with fat nodes
> exhausts heap more quickly than usual. If large nodes become the
> norm, cranking up GC nursery size might be in order.
>
> It's great to see that fat nodes finally work w
On Thu, Jun 23, 2011 at 4:54 AM, Johan Tibell wrote:
> On Thu, Jun 23, 2011 at 8:27 AM, Johan Tibell wrote:
>>> Is 5 the optimal number of bits to slice off at a time (ie the best
>>> fanout)? It sounds like node copy cost on insert argues for a
>>> slightly narrower fanout. You'll be evacuatin
I believe that's right.
Simon
| -Original Message-
| From: glasgow-haskell-bugs-boun...@haskell.org [mailto:glasgow-haskell-bugs-
| boun...@haskell.org] On Behalf Of Serge D. Mechveliani
| Sent: 23 June 2011 11:03
| To: glasgow-haskell-b...@haskell.org
| Cc: glasgow-haskell-users@haskell.
Simon,
thank you.
Currently, DoCon works under ghc-7.0.1.
And as I understand, the next release which is going to support DoCon
(with its heavy use of overlapping instances) will be ghc-7.2.
Regards,
Serge Mechveliani, mech...@botik.ru
On Wed, Jun 22, 2011 at 11:01:53AM -, GHC
On Thu, Jun 23, 2011 at 8:27 AM, Johan Tibell wrote:
>> Is 5 the optimal number of bits to slice off at a time (ie the best
>> fanout)? It sounds like node copy cost on insert argues for a
>> slightly narrower fanout. You'll be evacuating / scanning more words
>> total, but new nodes may equate
Dimitrios and I don't think there is a fundamental difficulty here, but it
involves some work on the constraint solver that we have not yet done,
especially concerning the evidence that is constructed for a proof.
So it's on the list, but currently not very high priority. Yell if it's
important
