Hi there,
I've been using Haskell since about 1995-ish and would
like to thank the ghc-team (in particular SPJ and SM)
for their support. Also I would like to thank all those
on the list for interesting contributions and help.
Thanks again.
Regards,
Marc van Dongen
--
M.R.C. van D
Martin Norbäck ([EMAIL PROTECTED]) wrote:
: > ''cannot find -lreadline
: >collect2: ld returned 1 exit status''
: Install the readline-devel package.
Thanks. It now works as a charm.
Regards,
Marc
___
Glasgow-haskell-users mailing list
[EMAI
anything about this on the web or in the
mini faq.
Anybody there to give me a quick hint how to get around
this?
Regards,
Marc van Dongen
--
Marc van Dongen | [EMAIL PROTECTED] |
Computer Science Department | Western Road | () ASCII ribbon campaign
University College Cork |
hange
:
: Put the default to 30M.
That seems to be on the low side.
Obviously people's opinions will
always differ.
Why not introduce environment
variables to allow for people to
set their own defauls settings?
Regards,
Marc [still lurking] van Dongen
--
Marc van Dongen, CS Dept |
Manuel M. T. Chakravarty ([EMAIL PROTECTED]) wrote:
[received message twice]
Am I just the only one or does everybody receive
messages posted to [EMAIL PROTECTED] and
[EMAIL PROTECTED] twice? I find
it a bit (I know I am exaggerating) annoying.
Is there a way to avoid this?
Regards,
Marc
__
Hello all,
When linking, ghc-4.08.1 fails due to a
ld: fatal: library -lreadline: not found
error. Is this a ghc error or should I get
that library from somewhere else?
Thanks in advance.
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 4903578
University College Cork
Marcin 'Qrczak' Kowalczyk ([EMAIL PROTECTED]) wrote:
[HEELP]
Are you using RULES? If you are then
try turning them all off. Just a thought.
Regards,
Marc
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/li
Simon Peyton Jones ([EMAIL PROTECTED]) wrote:
[snip]
: Are there any other GHC users who notice GC pauses?
Yes. I do. However, it doesn't really bother me a lot
because I am not a real-time person. Happy old year:-).
Regards,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone:
Simon Marlow ([EMAIL PROTECTED]) wrote:
: yes, I should have mentioned that you need to use a cpp macro to achieve the
: desired effect. eg. GHC's "ASSERT" macro:
:
:#define ASSERT(e) if (not (e)) then (assertPanic __FILE__ __LINE__) else
Cool. I'll try it the next time I have to debug som
Keith Wansbrough ([EMAIL PROTECTED]) wrote:
: I think Marc wants the line number of the occurrence of rdMap to occur
: in the error message, not the line number of the definition of the
: rule "lookupFM.range check".
Exactly.
Regards,
Marc
--
Marc van Dongen, CS Dept | phone
Simon Marlow ([EMAIL PROTECTED]) wrote:
: You're right in saying that errors can be generated at certain points in the
: source file, but these points (the beginning of a definition, a case branch,
: a type signature, a guard, an 'if' expression, etc.) have nothing to do with
: definition vs. cal
= error $ concat ["lookupFM :: key not in range in line ",line," in ",file]
The function #lookupFM would be the ``real''
lookupFM function. The idea is that after debugging
of a function one can just disable a rule in the
RULES section.
Just a thought.
Rega
mpile my
program for profiling. BTW: Is there a way to do this
with profiling as it is at the moment?
Yours,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 4903578
University College Cork, NUIC | Fax:+353 21 4903113
College Road, Cork, Ireland | Email: [EMAIL PROTECTED]
Dear ghc-team,
Very cool, indeed, the PDF uder guide. Just one
small comment. In the table of contents there
seems to be some problem with some of the page
numbers.
Just to let you know.
Regards,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 4903578
University
Michael Weber ([EMAIL PROTECTED]) wrote:
[...]
: $ cvs log ghc/lib/std/PrelArr.lhs
:
: revision 1.19
: date: 2000/03/14 12:16:00; author: simonmar; state: Exp; lines: +57 -57
: Simplfy the mutable array story:
: - rename MutableArray to STArray (and similarly
: for all oper
Hello again,
Sorry for asking again but I can't find the
answer in the on line user manual.
What does one have to do to use mutable arrays?
An old program won't compile anymore with a very
recent ghc from CVS. I am using GlaExts.
Thanks in advance.
Regards,
Marc van Dongen
--
Hello all,
I wanted to recompile some old programs with the
latest ghc from CVS. MutableArray wasn't known any
more. I do import GlaExts. What am I missing?
Regards,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 4903578
University College Cork, NUIC | Fax:+3
your program were to read the values for yFields
from a file?
Just a thought.
Regards,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 903578
University College Cork, NUIC | Fax: +353 21 903113
College Road, Cork, Ireland | Email: [EMAIL PROTECTED]
Simon Peyton Jones ([EMAIL PROTECTED]) wrote:
: | This is really a big problem. I have been strugling with it
: | myself. The safest thing to do is to use `error' (sad but
: | true). That's the only thing I can recommend:-(
:
: This is a long-standing and embarassing bug which is
: alas not quic
Sorry about this. I forgot to group reply.
- Forwarded message from Marc van Dongen <[EMAIL PROTECTED]> -
Date: Fri, 7 Apr 2000 09:55:12 +0100
From: Marc van Dongen <[EMAIL PROTECTED]>
To: "Michael A. Jones" <[EMAIL PROTECTED]>
Subject: Re: Debugging techniq
Julian Seward (Intl Vendor) ([EMAIL PROTECTED]) wrote:
[patch problems]
: This is the one we use:
:
: cam-02-unx:~/Feb24/fpt/ghc$ patch -v
: patch 2.5
: Copyright 1988 Larry Wall
: Copyright 1997 Free Software Foundation, Inc.
:
: It has never given me any problems. I think it is par
George Russell ([EMAIL PROTECTED]) wrote:
[...]
: > Should I ignore these or look for a different patch?
: My first reaction would be to look for a different CVS, like GNU CVS 1.10. If you're
: already using that, get the GNU patch as well (which has many more options than
: most patches).
Tha
Should I ignore these or look for a different patch?
Thanks in advance.
Regards,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 903578
University College Cork, NUIC | Fax: +353 21 903113
College Road, Cork, Ireland | Email: [EMAIL PROTECTED]
about the confusion.
Regards,
Marc van Dongen
;t find it because the archives don't seem to
be updated on a day to day-ish basis. Is there any
chance this will be done? I find the archives very
useful.
Regards,
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 903578
University College Cork, NUIC | Fax: +353 21 9
Hello,
I want to use rules to avoid the generation of intermediate lists.
Therefore I need to know how list-comprehensions of the following
form are translated:
[f a | a <- as]
Is this:
map f as?
Thanks in advance.
Marc van Dongen
--
Marc van Dongen, CS Dept | phone: +353 21 903
hat usages of the form:
h a@(A i) (A _) = f a
h (A _) b@(B j) = f b
h _ b = f b
will *always* be translated into:
h (A i) (A _) = g i
h (A _) (B j) = g j
h _ b = f b
or something similar.
Thanks in advance.
Regards,
Marc van Dongen
cause of the dependence
on the term order.
Regards,
Marc van Dongen
[I cc'd this to haskell users since I couldn't find
out what the name was of the forum to which the original
thread belonged to. Appologies if I have made a mistake
and I am upseting somebody.]
Jerzy Karczmarczuk:
: horrible complexity. Does it answer your question?
s, see the Theorema project http://www.theorema.org
Regards,
Marc van Dongen
___
Marc van Dongen, CS Dept | phone: +353 21 903578
University College Cork, NUIC | Fax: +353 21 903113
College Road, Cork, Ireland | Email: [EMAIL PROTECTED]
Simon PJ:
: How about this? Don't say Santa never comes:
:
: Foo.hs:5:
: Ambiguous type variable(s) `a' in the constraint `Eq a'
: arising from use of `==' at Foo.hs:5
: In the first argument of `&&', namely `(b == b)'
: In a guard for an equation for `example': (b == b) && (a =
at a very rapid speed. Any
additional information to prune this search space will
make the problem of locating actual errors signifficantly
more easy.
Please note that this is not at all the highest point on
my wish list. I only mention it because I think it would
improve using ghc. In oth
Hi there,
I was wondering if somebody could help me with this.
I have the habit of exporting everything explicitly from
a module. Is there any way of saying that certain
RULES are exportable/importable from a module and others not?
Regards,
Marc
Sergey:
One small correction:
The sed script should be:
sed -e 's/.*\/\([^\/][^\/]*\)\.hs/$(E)\/\1.o, $(E)\/\1.hi/'
Of course:
:g/.*\/\([^\/][^\/]*\)\.hs/s//$(E)\/\1.o, $(E)\/\1.hi/
in vi should also work.
Regards,
Marc
. These lines being so numerous, is there any shorter way
: to redirect these things?
: ( /.hs --> $(E)/.o, $(E)/.hi )
Use sed?
sed -e 's/.*\([^\/][^\/]*\)\.hs/$(E)\/\1.o, $(E)\/\1.hi/'
Regards,
Marc van Dongen
re
: dead.
Try http://yeats.ucc.ie/~dongen/TclHaskell.tar.gz
I haven't checked wheter it really works because I haven't got the
time. The url may change in a few weeks time but I'll let people know.
In the mean time, have fun.
Regards,
Marc van Dongen
ymore. I'll
see what I can do to put it on some website publicaly accessible.
Having said that, I am rather busy untill the end of this month. Furtermore
this is only a favour, so this may take a few days. Contact me by the end
of next week if I haven't made any announcements.
Regards,
Marc van Dongen
0),(1,0),(0,1),(1,1),(2,0),(2,1),(0,2),(1,2),(2,2),(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)
]
For [0..4] [0..2] it'll generate:
[(0,0),(1,0),(0,1),(1,1),(2,0),(2,1),(0,2),(1,2),(2,2),(3,0),(3,1),(3,2),(4,0),(4,1),(4,2)
]
Regards,
Marc van Dongen
Simon M:
: > : We try to please. How about this?
: > :
: > : Simon
: > :
: > :
: > : Marc.hs:7:
: > : Cannot unify the type-signature variable `p' with the type `[]'
: > : Expected type: [a]
: > : Inferred type: p a1
: > : In the first argument of `ci', namely `a'
: > : In the
ression: ci a
Great!
Regards,
Marc
:
: > -Original Message-----
: > From: Marc van Dongen [mailto:[EMAIL PROTECTED]]
: > Sent: Thursday, April 15, 1999 6:01 PM
: > To: Simon Peyton-Jones
: > Subject: Re: Proposal for error message improvement
: >
: >
: > : "I
Dear all,
According to the user guide (section 6.2) there
should be a document calld gmp.info in the distribution.
I tried to locate it, but it is not there.
Is there anybody who can tell me where to get it.
Regards,
Marc van Dongen
ld be greatly appreciated.
Regards,
Marc van Dongen
Marc van Dongen, Computer Science Dept | phone: +353 21 903084
University College Cork, NUIC | Fax: +353 21 903113
College Road, Cork, Ireland | Email: [
Dear All,
I am hoping that somebody will be able to help
me with this before the hollidays are over:-)
I am trying to locate a document with a name
state_interface or something similar which is
being named in some file in the 4-01 distribution.
I have tried to locate it but failed. It seems
as
______
Marc van Dongen, Computer Science Dept | phone: +353 21 903083
University College Cork, NUIC | Fax: +353 21 903113
College Road, Cork, Ireland | Email: [EMAIL PROTECTED]
P1 50K heep | 75K heap|
| P2 55K heap | 75K heap|
| P3 55K heap | 75K heap|
++-+
All profiled -O versions are equally fast (+/- 2.8 sec).
The non-profiled -O versions are equally fast as well (+/- 2.3 sec).
Regards,
Marc van Dongen
satisfied with a few KB only.
How to narrow this down further? I have cost-centres placed
everywhere, but only $gm seems to be Heap-greedy.
Thanks in advance,
Marc van Dongen
Marc van Dongen, Computer Science Dept | phone
aven't found it. If there's anybody with
a good suggestion how to continue trying to find it, it
would be *GREATLY* appreciated.
Helplessly,
Marc van Dongen
Marc van Dongen, Computer Science Dept | phone: +353 21 90
= A
> B p q
> g :: (Num p,Ord q) => (AB p q) -> Bool
> g (B _ _) = A
which is the kind of game I really want to play.
Thanks in advance.
Regards,
Marc van Dongen
Mare van Dongen | p
Dear Group,
I want to define two classes called Group and Ring.
The Group class is for Abelian Groups (G,+), i.e.
groups with a binary commutative operator ``+'' and an
identity element normally denoted by ``0''.
The Ring class is meant for cummutative
rings (R,+,*) with binary operators ``+''
49 matches
Mail list logo