With
ghc ParsecTest.hs -o pt
you get a link-time failure, because it looks as if the base package
Text.ParserCombinators.Parsec depends somehow on the package text.
module Main where
import Text.ParserCombinators.Parsec
ch = char 'C'
main =
do
seq ch (return
Ross Paterson wrote:
On Mon, Sep 06, 2004 at 12:10:09PM +0200, George Russell wrote:
With
ghc ParsecTest.hs -o pt
you get a link-time failure, because it looks as if the base package
Text.ParserCombinators.Parsec depends somehow on the package text.
Try -package parsec
OK, I have. But if
It's documented behaviour.
* import Text.ParserCombinators.Parsec will work without any -package
flags, if any installed package has a module
Text.ParserCombinators.Parsec. It's very tiresome adding -package flags
all the time.
* The link step needs -package flags, because it only gets .o
Bugs item #1018607, was opened at 2004-08-29 09:36
Message generated for change (Comment added) made by nobody
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1018607group_id=8032
Category: None
Group: None
Status: Open
Resolution: None
Priority: 5
At 1:52 PM +0100 9/6/04, Simon Marlow wrote:
On 06 September 2004 13:43, Simon Peyton-Jones wrote:
* The link step needs -package flags, because it only gets .o files,
and we didn't want it to start hunting through .hi files (though that
would be possible)
Just to expand on this a little: it's
On 02 September 2004 17:31, MR K P SCHUPKE wrote:
When writing code in the compiler, how do you use pprTrace?
I want to print out the type of a SigD from HsDecl?
There are plenty of examples to be found in the compiler, but briefly
you'd use it something like this:
myFunction sigd =
If I print out HsSyn types with pprTrace, I get:
test{v} () = id{v} ()
or something similar (depending on the declaration). Is there
any way I can get it to print out the raw data structure?
Keean.
___
Glasgow-haskell-users mailing list
[EMAIL
On 05 September 2004 22:36, Gabriel Ebner wrote:
Gour [EMAIL PROTECTED] writes:
Since I plan to upgrade my computer to amd64, I'm interested what is
the current status of ghc on amd64 platfrom?
ghc-6.2.1 works fine, but unregisterised. That means it's pretty
slow, and the code it
On 06 September 2004 11:03, MR K P SCHUPKE wrote:
If I print out HsSyn types with pprTrace, I get:
test{v} () = id{v} ()
or something similar (depending on the declaration). Is there
any way I can get it to print out the raw data structure?
HsSyn doesn't have Show instances, so sorry no.
Would it cause me any problems if I added deriving Show to all the
types in compiler/hsSyn? (Can't think of a problem here... is there any
reason why this is not done by default? - It is really handy if trying to
pattern match on code syntax to be able to see what abstract syntax is
generated by
On 06 September 2004 11:11, MR K P SCHUPKE wrote:
Would it cause me any problems if I added deriving Show to all the
types in compiler/hsSyn? (Can't think of a problem here... is there
any reason why this is not done by default? - It is really handy if
trying to pattern match on code syntax
I have added some of the required deriving clauses, however I now
get lots of warnings about:
Bad eta expand
__coerce ()
(CmmParse.zgzg {- v rnrp -}
@ ()
@ ()
(__coerce CmmParse.ExtCode {- tc rB2 -} happyzuxzu1 {- v a1B9 -})
(__coerce CmmParse.ExtCode {- tc rB2
I need to change the boot .hi files for TypeRep, to include
the derivied show instance for TyThing, what is the format?
Keean.
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
You can't, I'm afraid:
http://www.haskell.org/ghc/docs/latest/html/users_guide/separate-compila
tion.html#MUTUAL-RECURSION
To get the instances in the right place, why not just add 'instance Show
T' everywhere you find 'instance Putputable T'?
I'm not keen on adding Show instances to the main
It's on my list to investigate, but seems harmless.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:glasgow-haskell-users-
| [EMAIL PROTECTED] On Behalf Of MR K P SCHUPKE
| Sent: 06 September 2004 11:35
| To: [EMAIL PROTECTED]; [EMAIL PROTECTED]; Simon
Marlow
| Subject:
Yes, it might be easier to elaborate the ppr instances... That
way I only have to modify instances I am interested in.
Keean.
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
It's a documented bug in GHC.
http://www.haskell.org/ghc/docs/latest/html/users_guide/bugs.html#BUGS-G
HC
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Stefan
| Karrmann
| Sent: 05 September 2004 13:57
| To: [EMAIL PROTECTED]
| Subject:
Hello,
I've posted undated versions of both these packages here..
http://homepages.nildram.co.uk/~ahey/HLibs/Data.COrdering/
http://homepages.nildram.co.uk/~ahey/HLibs/Data.Tree.AVL/
COrdering is needed by AVL. The AVL package has had quite
a few new goodies added, including support for using
I maybe don't fully grasp your goals here, but this sounds similar to some
early problems I ran into with Haskell (coming from comparable background),
and here are a couple of comments that _might_ just help:
(a) adding a type context to a 'data' declaration seems to be very rarely,
if ever,
Hi,
I found myself needing to quickly and effectively compute the median of an
array of ordered elements (read as: I want to build a perfectly balanced
kD-tree). Of course there was a nice imperative one, implemented for
language so-and-so and this-and-that but I couldn't find a Haskell
Dear Haskell list subscribers,
I'd be interested to learn what experiences you have had with recruiting
Haskell developers (I shall post a summary of infos worth mentioning to
the list if you e-mail me).
Also, does anyone here have noteworthy experiences in the area of
integration of code
Seventh International Conference on
Typed Lambda Calculi and Applications (TLCA '05)
Nara, Japan
21-23 April 2005
(Colocated with RTA as RDP '05)
*
* - PAPER SUBMISSION DEADLINE APPROACHING: *** September 10th! ****
* - BEST PAPER AWARD: A best paper award ($500) will be given to the *
* paper judged most innovative and practical. *
*
*
* - PAPER SUBMISSION DEADLINE APPROACHING: *** September 10th! ****
* - BEST PAPER AWARD: A best paper award ($500) will be given to the *
* paper judged most innovative and practical. *
Apologize if you receive multiple copies of this e-mail.
* CALL FOR PARTICIPATION
Third International Symposium on
Formal Methods for Components and Objects
(FMCO 2004)
The objective of
Call for Papers for
Methods for Modalities
A Special Issue of the Journal of Applied Logic
(http://www.sciencedirect.com/science/journal/15708683)
The workshop `Methods for Modalities' (M4M) organized every two
years aims to bring
On Fri, Sep 03, 2004 at 01:43:12AM +0100, Jochen L. Leidner wrote:
Finally, would it be considered spam to post Haskell-realted job postings
in this group? Thanks in advance.
I don't know if it would be considered spam, but I for one would
certainly welcome it.
David
--
David Overton
WWW:
Who is actually responsible for the Haskell HTTP and Browser modules
(http://homepages.paradise.net.nz/warrickg/haskell/http/)? The e-mail
indicated in the site (oinutter [at] hotmail.com) is returning...
Thanks,
-- Andre
___
Haskell mailing list
Hello,
I was wondering if the list diff operator \\ takes advantage of situations
where the list data type is in class Ord, besides being in Eq. If it is
only in Eq, then \\ must be O(n^2), while if it is in Ord, a O(nlogn) \\
can be written.
Basically, I'm wondering if I should avoid using the
I think there are so few such opportunities that it would not overwhelm
the list. I should also point out that you can post such openings at
http://www.haskell.org/jobs.html by sending an e-mail to
[EMAIL PROTECTED] and [EMAIL PROTECTED]
Regards,
Lyle
Jochen L. Leidner wrote:
Finally, would
30 matches
Mail list logo
