Dear GHC developers,
What about compiler's warning of repeated import of items?
For the large import lists this may be useful,
and ghc-6.01 seems to lack this:
--
module T where
import Maybe (isJust, isJust)
f = isJust
--
ghc -c T.hs
Hi:
I'm a newbie on using CVS but some time ago I decided to compile against
the code on the CVS repository. I'm interested on 6.3 version.
Recently I found this problem, after making autoheader,autoconf:
ghc/include: make boot
mkDerivedConstants.c:34 'StgTickyInfo' undeclared (first use of
Hi list
I try to compile ghc 6.0.1 on RH 9. In my compile-it-my-self-fanatism I
need to do a two-stage-bootstrap. As explained in the porting and
bootstrapping documentation I used the cross-port script distrbuted with
the source. But in the first stage ghc issues an error message as follows:
maril_manson:
I try to compile ghc 6.0.1 on RH 9. In my compile-it-my-self-fanatism I
need to do a two-stage-bootstrap. As explained in the porting and
bootstrapping documentation I used the cross-port script distrbuted with
the source. But in the first stage ghc issues an error message as
The classic way to write a lift function for tuples is, of course:
liftTup f (a, b) = (f a, f b)
which has a type of (a - b) - (a, a) - (b, b). I've been wondering if
it would be possible to write a function that doesn't require the types in
the tuple to be the same, just that the types in the
On 2003-11-18 at 10:46EST Abraham Egnor wrote:
The classic way to write a lift function for tuples is, of course:
liftTup f (a, b) = (f a, f b)
which has a type of (a - b) - (a, a) - (b, b). I've been wondering if
it would be possible to write a function that doesn't require the types in
hello,
Ben Escoto wrote:
Maybe eventually I will see a need for mapWriter. As a passing
thought, I wonder how many programmers can read the mapWriterT
documentation:
mapWriterT :: (m (a, w) - n (b, w')) - WriterT w m a - WriterT w' n b
and start pounding the code out? Anyway, once I get this
On Tue, Nov 18, 2003 at 04:34:43PM +, Jon Fairbairn wrote:
On 2003-11-18 at 10:46EST Abraham Egnor wrote:
The classic way to write a lift function for tuples is, of course:
liftTup f (a, b) = (f a, f b)
which has a type of (a - b) - (a, a) - (b, b). I've been wondering if
it
[[ -- Apologies for multiple copies of this message -- ]]
Please,
find attached the list of accepted papers
to COORDINATION 2004.
--
***
Emilio Tuosto
Universita' di Pisa
Dipartimento di informatica
On Tue, Nov 18, 2003 at 12:40:45PM +1100, Bernard James POPE wrote:
but here comes the problem: how can I define new Exception codes,
instead of raising userError all the time? I think it makes sense for a
library to raise specialized exceptions, instead of userErrors. There
is such a
At 21:18 17/11/03 +0100, [EMAIL PROTECTED] wrote:
I have a need for an algorithm to perform subsumption on partially
ordered sets of values. That is, given a selection of values from a
partially ordered set, remove all values from the collection that
are less than some other member of the
At 09:14 18/11/03 +1300, Tom Pledger wrote:
Graham Klyne writes:
:
| Below is some code I have written, which works, but I'm not sure
| that it's especially efficient or elegant. Are there any published
| Haskell libraries that contain something like this?
Hi.
Partially ordered sets are in
12 matches
Mail list logo
