Jens Petersen [EMAIL PROTECTED] writes:
Jens Petersen [EMAIL PROTECTED] writes:
It would be good if ghc would at like give a better error
message when an empty cmd is passed to -pgmX.
Rather I think it should abort rather than forking an empty
command...
How about something like the
Hi!
Ghc seems to have some problems in inferring the most general types of
RULES pragmas. The bug was not present in 5.02.1 but shows up in a cvs
version checked out yesterday.
Here's the problem:
Consider the following example from the user's guide:
{-# RULES
map/map forall f g xs.
Ashley Yakeley [EMAIL PROTECTED] writes:
At 2002-02-19 14:13, Duncan Coutts wrote:
So what I mean is, can we have links to more binaries than just Red Hat?
Debian, Mandrake, FreeBSD. (I know these's SuSE)
Seconded.
I'm not sure what the point would be, if they are in the
distributions
What is the politically correct way using the FFI and ghc5.03
(which I have just managed to compile from
CVS) to import an externally defined object (not a function)?
I have a source file containing the line
foreign label default_options defaultOptions :: CString.CString
for which
It seems to me that it might be very useful for a module to export the
pattern matching operators for a datatype without exporting the
constructors. Suppose we have
data A = X {a::Int, b::Float}
And we want to maintain the invariant that b is a floating-point
representation of a. So
Jim Farrand [EMAIL PROTECTED] wrote:
both hugs and ghc in their Linux distro *as standard*. This could
significantly help Haskell takeup amongst the unwashed
masses. :-)
Well, same applies for FreeBSD.
And Debian.
So what I mean is, can we have links to more binaries than
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
I'm not sure what the point would be, if they are in the
distributions anyway? Isn't it better to install them by apt-get or
up2date or whatever? (In fact, I had almost thought manually
downloading packages a thing of the past, but then the IT
Simon Marlow [EMAIL PROTECTED] writes:
On the other hand, you'd need something like mingw for OS/2 - does
such a beast exist?
The substring emx refers to an OS/2 version of gcc and libraries
that make OS/2 look really like Unix from the programmer's point of
view. (It probably even pre-dates
On Wed, Feb 20, 2002 at 03:45:15PM +0200, Lauri Alanko wrote:
On Wed, Feb 20, 2002 at 01:37:52PM -, Simon Marlow wrote:
Could someone who is Debian-compliant tell me where I should be pointing
for Debian packages?
http://ftp.debian.org/debian/pool/main/g/ghc5/
Though of course any
Is the revised Haskell98 report going to be put in its proper place on
the web site any time soon? As it is, it is sitting off to the side
while the old Report sits in the seat of honor.
David Feuer
___
Haskell mailing list
[EMAIL PROTECTED]
===
The submission deadline for ASIA-PEPM'02 and FLOPS'02
has ben extended until March 8, 2002.
===
FINAL CALL FOR PAPERS
ASIAN
I don't want to do that until its finished!
Which I earnestly hope will be soon.
Simon
| -Original Message-
| From: David Feuer [mailto:[EMAIL PROTECTED]]
| Sent: 20 February 2002 08:43
| To: [EMAIL PROTECTED]
| Subject: Haskell 98 Report
|
|
| Is the revised Haskell98 report going
OK, so it does look as though it's the same idea as
that described in our paper. Good.
I have not implemented, yet. As always my implementation
priorities are strongly influenced by my perception of whether
some enhancement would be used. Maybe you can outline
why such a change would be
liftIOtoMyMonad_ :: IO () - MyMonad ()
liftIOtoMyMonad_ m = liftIOtoMyMonad' (const m) ()
I'm having problems compiling this one: The last statement in a 'do'
construct must be an expression
___
Haskell mailing list
[EMAIL PROTECTED]
[answering myself...]
liftIOtoMyMonad_ :: IO () - MyMonad ()
liftIOtoMyMonad_ m = liftIOtoMyMonad' (const m) ()
I'm having problems compiling this one: The last statement in a 'do'
construct must be an expression
The problem is not related with liftIOtoMyMonad_ , but with
On Thu, 21 Feb 2002, Andre W B Furtado wrote:
liftIOtoMyMonad_ :: IO () - MyMonad ()
liftIOtoMyMonad_ m = liftIOtoMyMonad' (const m) ()
I'm having problems compiling this one: The last statement in a 'do'
construct must be an expression
No problems here using no flags either.
Has anyone investigated monadic call-with-current-continuation in
Haskell? Given this:
class (Monad m) = PeirceMonad m where
{
peirceM :: ((a - m b) - m a) - m a;
};
...which Monads can be made PeirceMonads?
The corresponding non-monadic
My point is that there are some things that can't easily be expressed
in current Haskell (like generic printing) that are useful and
might be aided by meta-programming technology. The interesting question
is can it be done in a way that preserves whatever we want from the type
system:
You don't need meta-programming technology (reflection) to do things like
generic prinitng. A generic programming extension of Haskell (like
Generic Haskell, or derivable classes) can do the job for you.
Isn't generic programming usually based on a kind of compile-time
reflection (if the
You don't need meta-programming technology (reflection) to do things
like
generic prinitng. A generic programming extension of Haskell (like
Generic Haskell, or derivable classes) can do the job for you.
Isn't generic programming usually based on a kind of compile-time
reflection (if the
| and I know from testing earlier versions that the
| generic-classes support was pretty buggy. Is there any hope
| of a revival? Does it already work in CVS? I suspect it will
| rot away if nobody works on it.
|
| Any comments from the implementors - does the idea fit well
| with ghc? Is it
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wednesday 20 February 2002 08:46, Bernard James POPE wrote:
There are numerous ways to provide security for your data types.
(In)Visibility isn't security. I have more than often witnessed Java users
who thought private keyword was for
Hi,
I'm trying out some combinatorial parsers, and I ran into a slightly
inelegant construction. To parse a sequence of things, we have a function
like
pThen3 :: (a-b-c-d) - Parser a - Parser b - Parser c - Parser d
pThen3 combine p1 p2 p3 toks =
[(combine v1 v2 v3, toks3) | (v1,
Mark Wotton writes:
| Hi,
|
| I'm trying out some combinatorial parsers, and I ran into a slightly
| inelegant construction. To parse a sequence of things, we have a function
| like
|
| pThen3 :: (a-b-c-d) - Parser a - Parser b - Parser c - Parser d
| pThen3 combine p1 p2 p3 toks =
|
On Wed, Feb 20, 2002 at 01:15:36PM -0800, Simon Peyton-Jones wrote:
Another possiblity would be to make the ConCls class look like this
class ConCls c where
name :: String
arity :: Int
...etc...
Now we'd have to give an explicit type argument at the call
25 matches
Mail list logo
