For some reasons Philip's email was rejected by the mailing list.
I am reposting his message. See below.
Cheers, George
Begin forwarded message:
> From: Philip Wadler
> Date: 2011-October-11 11:48:31 GMT+02:00
> To: Simon Peyton-Jones , George Giorgidze
>
> Subject: Fwd: Two Proposals
>
> F
On Sun, Oct 9, 2011 at 10:33 PM, George Giorgidze wrote:
> Thanks to all of you for providing feedback on my proposal and for providing
> alternatives.
>
> In this email, I will try to collect all proposals and give pros and cons for
> each of those (although I will try to provide a good argumen
Hello,
Does anyone have any advice about how I might make a smallish GHC installation?
The context is that I need to make a demo VM, which has a limited
amount of space, and I'd like to have GHC installed on the system but
the default GHC installation (~700MB) does not fit. The installation
does
Hello,
When benchmarking my new vector-bytestring[1] package I discovered
that building the following program causes GHC to go into, what seems
to be, an infinite loop:
import Data.Vector (Vector)
import qualified Data.Vector.Generic as VG
main = print $ VG.foldl f z (VG.fromList [] :: Vector In
On 11 October 2011 21:11, Bas van Dijk wrote:
> Note that the program also builds fine when I change the 'f' and 'z' to:
>
> f = flip (:)
> z = []
>
Oops, I meant to say:
Note that the program also builds fine when I change the 'f' and 'z' to:
f = (+)
z = 0
Hi,
Am Dienstag, den 11.10.2011, 11:02 -0700 schrieb Iavor Diatchki:
> The context is that I need to make a demo VM, which has a limited
> amount of space, and I'd like to have GHC installed on the system but
> the default GHC installation (~700MB) does not fit. The installation
> does not need t
Also, I find UPX essential in this kind of situation. It can make
self-decompressing executables without a noticable slowdown (in fact, a
speedup on network drives!).
Typically I see something like this:
ghc:*54.6 MB*
after 'strip': *33.1 MB*
after UPX: *6.2* * MB*
-Ryan
On Tuesday 11 October 2011, 21:11:30, Bas van Dijk wrote:
> Hello,
>
> When benchmarking my new vector-bytestring[1] package I discovered
> that building the following program causes GHC to go into, what seems
> to be, an infinite loop:
>
>
> I use vector-0.9 and ghc-7.2.1.
Replicated with vec
Hi,
I came upon this when playing with foldr and filter. Compare the two
definitions:
testr n = foldr (\x y -> x && y) True [t | (_, t) <- zip [1 .. n] [True,
True ..]]
testr' n = foldr (\x y -> y && x) True [t | (_, t) <- zip [1 .. n] [True,
True ..]]
I tried these functions on ghci (The Glori
Yeah, you should absolutely mind the order of the parameters (or more
generally, when the operation isn't commutative), the strictness of the
function's second parameter. In this case, both (&&) and (||) are strict in
their first parameter, but both "short circuit" if the first parameter is
False/T
Hi,
I've continued my search for a proper workaround. Again, I did find some
unexpected results. See below.
On 09.10.2011, at 17:56, wagne...@seas.upenn.edu wrote:
> Quoting Jean-Marie Gaillourdet :
>
>> That sounds plausible. Do you see any workaround? Perhaps repeatedly
>> evaluating typeO
11 matches
Mail list logo
