Good news everyone. LambdaCase and MultiWayIf are now in HEAD. Thanks
for participating in the final push!
On Thu, Jul 5, 2012 at 9:42 PM, Mikhail Vorozhtsov
wrote:
>
> Hi.
>
> After 21 months of occasional arguing the lambda-case proposal(s) is in
> danger of being buried under its own trac tic
I actually made builds of GHC 7.4.1 with Snow Leopard that fixed this
issue back when I had it:
http://code.haskell.org/~thoughtpolice/ghc-741-osx-sl/
I must have forgotten to email the list. I have since upgraded to Lion
however. The builds are 64bit only as well. But that should be an easy
mean
On Mon, Jul 16, 2012 at 12:26 PM, Tony Hannan wrote:
> I'm still seeing this problem in 7.4.2. Is there a workaround?
> I'm also on Snow Leopard and using 64-bit version.
If you grabbed the installer from
http://www.haskell.org/ghc/download_ghc_7_4_2 you'll need to build
your own locally... the n
I'm still seeing this problem in 7.4.2. Is there a workaround?
I'm also on Snow Leopard and using 64-bit version.
Thanks,
Tony
On Sun, Dec 25, 2011 at 12:35 AM, austin seipp wrote:
> Hello GHC hackers,
>
> I have been trying the recent 7.4.1-rc1 release on my OSX Snow Leopard
> machine. I am u
Am Montag, den 16.07.2012, 21:26 +0300 schrieb Wolfgang Jeltsch:
> Am Freitag, den 13.07.2012, 13:40 +0100 schrieb Ross Paterson:
> > Remember that there is a \ in arrow notation in addition to proc.
> > So one might expect any abbreviation for \x -> case x of {...}
> > to mean the same \ thing in
Am Freitag, den 13.07.2012, 13:40 +0100 schrieb Ross Paterson:
> Remember that there is a \ in arrow notation in addition to proc.
> So one might expect any abbreviation for \x -> case x of {...}
> to mean the same \ thing in arrow notation too.
I completely agree. I had forgotten about the \ in a
Simon mentioned a system of doing multiple GC's to measure actual live data.
But wouldn't a more limited alternative be capping *allocation* rather than
live data? GHC already has an mechanism to preempt IO threads based on an
allocation trip wire. In fact that's *the* preemption mechanism. Isn
| > Ah! This rule will only match if the LHS is
| >
| > f (WriterT w Identity) ($fMonadWriterT w Identity dm
| > $fMonadIdentity)
| >
| > So it's a nested pattern match. That makes the LHS match less often;
| namely only when the dictionary argument to 'f' is an application of
| $fMonadWr
