Ann: HAllInOne bug fix release

[Hal Daume]

(cafe)

This seems like a reasonable hypothesis.  Is there a way to get GHC to =
keep trying, despite the enormity of the input file?

Specifically, I expect it to do a better job of (a) inlining and (b) =
specialization.  Is there a way to hint to it to try a bit harder?  :)

 - Hal

 --
 Hal Daume III                                   | hdaume@isi.edu
 "Arrest this man, he talks in maths."           | www.isi.edu/~hdaume


> -----Original Message-----
> From: Koen Claessen [mailto:koen@cs.chalmers.se]=20
> Sent: Thursday, July 31, 2003 1:49 AM
> To: Simon Peyton-Jones
> Cc: Hal Daume; Wolfgang Jeltsch; The Haskell Mailing List
> Subject: RE: Ann: HAllInOne bug fix release
>=20
>=20
> Simon Peyton-Jones wrote:
>=20
>  | I don't know why the all in one version might go
>  | slower though.
>=20
> How about some (artificial) cut-offs during optimization
> phases? Optimizing a hugs module could lead to some kind of
> combinatorial explosion (which gets cut off by the
> optimizer) which does not happen when you have separate
> modules?
>=20
> Just my 2 =F6re!
>=20
> /Koen
>=20
>=20