Hi,
I never heard a reply to this.
Is there any hope of getting this fixed?
If not, I'll have to ship my own private binary release of greencard
under windows, just so that it doesn't install in a directory with an
embedded space(!) :-(
Thanks,
-antony
--
Antony Courtney
Grad.
Actually, the two 'b's aren't the same, as you will see if you
use -dppr-debug, or if you look at the .hi file. So the typing
for the rule looks right to me. If it isn't matching when you think
it should, it must be for some other reason. (Do you agree?)
Perhaps -ddump-rules should 'tidy'
Hi,
you're making a mountain out of a molehill; couple of
workarounds spring to mind:
* transform the -i path you feed to GHC -M, i.e., something
like
ghc -M -i`cygpath -w -s c:\Program Files\GreenCard`/lib/ghc
* post-process the generated dependencies file to insert the double
Hi,
I typed:
ghc Main.hs
and then GHC said:
GHC.EXE: panic! (the `impossible' happened, GHC version 5.02.2):
Maybe.fromJust: Nothing
Please report it as a compiler bug to [EMAIL PROTECTED],
or http://sourceforge.net/projects/ghc/.
-- Maarten
Hi,
looks like a bona fide bug; thanks for reporting it. In order to
be able to fix it, any chance of you sending us that Main.hs?
thanks,
--sigbjorn
- Original Message -
From: Loffler [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Monday, February 25, 2002 12:47
Subject: (no subject)
| Suppose I have the following RULES pragma:
|
| {-# RULES
| foo forall a . foo a = (\x - bar x) a
| #-}
|
| Ok, it's stupid but I have examples where this is motivated, trust me.
|
| Now, it seems that GHC simplifies the rule because what I get
| when compiling it with -ddump-rules is the
Not yet. But Jeff Lewis is (I believe) planning to work actively
on this.
Simon
| -Original Message-
| From: Hal Daume III [mailto:[EMAIL PROTECTED]]
| Sent: 24 February 2002 16:55
| To: GHC Users Mailing List
| Cc: [EMAIL PROTECTED]
| Subject: core language external representation
|
After reading your email i went to the discussion of IArray
on the haskell
doc page
(http://www.haskell.org/ghc/docs/latest/set/sec-iarray.html) and
am somewhat disturbed by it. There is the introduction of
the following
class:
class HasBounds a where
bounds :: Ix ix = a ix e -
On Mon, 25 Feb 2002, Simon Peyton-Jones wrote:
| Suppose I have the following RULES pragma:
|
| {-# RULES
| foo forall a . foo a = (\x - bar x) a
| #-}
|
| Ok, it's stupid but I have examples where this is motivated, trust me.
|
| Now, it seems that GHC simplifies the rule because
Josef,
Ah, I see. I think you are trying to do something quite hard,
akin to higher-order matching, which is the kind of thing Oege's
MAG system does. I'm copying him so he can confirm or deny.
In general, it is true that
(\x. ...x...) E
might match (f E), for some expression E,
On Monday 25 February 2002 02:55 am, Simon Peyton-Jones wrote:
Not yet. But Jeff Lewis is (I believe) planning to work actively
on this.
Well put. I plan on working on this, but no sooner than mid-march.
--Jeff
___
Glasgow-haskell-users mailing
I have an application that uses multiple processes and multiple threads
together. What's the best way to detect child process terminations?
The initial thread in the inital process serves as driver of the
application. It creates child processes and threads to carry out
portions of the
Hello,
I´m new in this list and I think that it´s a very good idea, because we
can show our doubts.
I have a doubt in GHC: How can we include a folder in the compiling
process? Example: If one file called main.hs requires some others modules
that are in one folder, how can compile it
I had meant to send this message to the Haskell list, because I think
there may be some readers who have good ideas about it.
Simon
-Original Message-
From: Simon Peyton-Jones [mailto:[EMAIL PROTECTED]]
Sent: 20 February 2002 21:16
To: Patrik Jansson; Haskell Cafe List
Cc: Ralf Hinze;
Using FiniteMap, I often run into robustness problems.
same (?) here! a student of mine recently came across a similar problem
(with a hand-made search tree): he expected to run
listToFM $ [(0, ()) | i - [0..10]]
in constant space, but instead it took all the stack and/or heap.
we
The following email address, [EMAIL PROTECTED] has been removed from the Verba
Volant Newsletter list.
If you did not cancel your email address or you wish to continue receiving Verba
Volant, please send an e-mail to [EMAIL PROTECTED]
Thank you and best regards,
Verba Volant
On Mon, Feb 25, 2002 at 03:38:39PM +, Malcolm Wallace wrote:
nhc98 manages to parse and compile both expressions with ease, no doubt
because it uses parser combinators rather than a table-driven mechanism.
Yes, but it reports type errors for the variants
f x = (\x - x*x .)
In the table of precedence in the original Report (now deleted in
the revised Report), it makes it clear that a rightward-extending
let, if, or lambda has a lower precedence than an infix operator,
so for instance the parse
h = (let op x y = y in (3 `op`))
is correct and
Hi, I'm writting a small parser in Haskell and, when it is all done, I get
the following problem: Type Binding.
The thing is, I have 3 main functions:
1) Read the file, its type is: [Char] -IO [Char] (see InputOutput.hs)
2) Parse a string (using words and readDec), its type is: Integral a =
On Mon, Feb 25, 2002 at 05:07:35PM -, Simon Marlow wrote:
On the other hand, one way to fix this problem *is* to specify the
relative precedence of 'let' co. as compared to infix operators
(namely that 'let' should have a lower precedence). That would be a
reasonable fix for the H98
| 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 site:
|
|show {| Constr c t |} (Con x) = (name {| c |})
You probably want to do something like this:
main =
do {
contents - input twoboxes.dat
return (control (parser contents))
}
At 11:53 25-02-02 -0300, Juan M. Duran wrote:
Hi, I'm writting a small parser in Haskell and, when it is all done, I get
the following problem:
I thing that wont works, look:
contents :: IO [Char]
parser :: Integral a = [Char] - [a]
control :: [Float] - [[Float]]
The two problems are:
1) The input of parser. Doesnt match with the type of input
2) The input of control (or the output of parser). Doesn match
with the
Hi,
I'm writing a program for my final project at uni and I've come across the
following annoying bug in my program. Basically, I have an interactive
text prompt and I wish to be able to write commands into the prompt. I am
currently using the function 'getLine', which as it's name suggests
24 matches
Mail list logo
