Hi Ben,
while in the eye of the cyclone, as we're waiting for these last few OS X
issues to clear up... I was wondering, do you currently have a means to
"vet" release candidates before cutting a new release?
More to the point, to check that a point release like these doesn't include
any breaking
Oops, I completely missed you saying that despite reading your post
multiple times and actually quoting it. Sorry about that.
But yes, that makes it very clear, thanks. Doable, even if a pain in the
neck. The motivation for my question was that I vaguely recalled
encountering code that uses impred
Hi,
Lennart suggested that some time ago, here is the thread from the last time
we discussed it:
https://mail.haskell.org/pipermail/haskell-prime/2012-July/003702.html
I think it is a good plan!
-Iavor
On Mon, Oct 3, 2016 at 4:46 AM, Richard Eisenberg
wrote:
> By all means make the proposa
Hello everyone,
Over the last few weeks I have been gradually pushing away at increasing
our Harbormaster coverage. I'm happy to report that Harbormaster should
now test commits on,
* x86_64 Ubuntu Linux
* x86_64 Mac OS X Sierra
* x86_64 Windows (although the bugs are still being worked out he
By all means make the proposal -- I like this idea.
> On Oct 3, 2016, at 4:29 AM, Herbert Valerio Riedel wrote:
>
> Hi *,
>
> I seem to recall this was already suggested in the past, but I can't
> seem to find it in the archives. For simplicity I'll restate the idea:
>
>
>foo :: Int -> In
Fine with me!
Simon
| -Original Message-
| From: ghc-devs [mailto:ghc-devs-boun...@haskell.org] On Behalf Of
| Herbert Valerio Riedel
| Sent: 03 October 2016 09:29
| To: ghc-devs
| Subject: Allow top-level shadowing for imported names?
|
| Hi *,
|
| I seem to recall this was
Indeed, as I said “I mis-spoke before: In my proposal we WILL allow types like
(Tree (forall a. a->a))”.
So yes, such types will be possible in type signatures (with
ImpredicativeTypes). But using functions with such type signatures will be
tiresome, because you’ll have to use VTA on every occ
I don't see why not. (But then again I wasn't around for Haskell98!)
Edward
Excerpts from Herbert Valerio Riedel's message of 2016-10-03 10:29:06 +0200:
> Hi *,
>
> I seem to recall this was already suggested in the past, but I can't
> seem to find it in the archives. For simplicity I'll restate
Hi *,
I seem to recall this was already suggested in the past, but I can't
seem to find it in the archives. For simplicity I'll restate the idea:
foo :: Int -> Int -> (Int,Int)
foo x y = (bar x, bar y)
where
bar x = x+x
results merely in a name-shadowing warning (for -Wall
