I can confirm that this happens on my solaris machine as
well. Moreover it
crashes my computer! I have seen the same crash when working
with the ffi
on solaris but haven't been able to reproduce it. What
happens is this:
In the window I'm running ghci/my ffi application gets filled
A bug thank you; now fixed.
Please send bug reports about GHC to [EMAIL PROTECTED],
not to the Haskell mailing list.
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Brandon
| Michael Moore
| Sent: 08 November 2003 13:20
| To: [EMAIL PROTECTED]
It seems as if the RPM and .tar.gz versions of ghc-6.0.1 are binary
incompatible. That is, a library built for one will not necessarily
work on the other. For example, libHSbase.a defines the symbol
GHCziRead_lvl18_closure in the .tar.gz version, which can be
externally called; however in the
It seems as if the RPM and .tar.gz versions of ghc-6.0.1 are binary
incompatible. That is, a library built for one will not necessarily
work on the other. For example, libHSbase.a defines the symbol
GHCziRead_lvl18_closure in the .tar.gz version, which can be
externally called; however in
The answer, once it stuck me, seemed quite obvious: use
--show-iface and
the compiler will either show me the interface (I used the
compiler with
right version) or will complain and say that it expected
number this and
that but found the number I was looking for. Sadly, when
doing
Glynn Clements [EMAIL PROTECTED] writes:
Stefan Reich wrote:
I'd like to ask a general question about unsafePerformIO: What exactly
does unsafe mean? Just impure or rather may lead to all kinds of
problems, you better don't use this?
Essentially both. Haskell assumes purity (referential
Feature Requests item #837563, was opened at 2003-11-06 16:47
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=358032aid=837563group_id=8032
Category: None
Group: None
Status: Open
Priority:
Good idea -- done.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:glasgow-haskell-users-
| [EMAIL PROTECTED] On Behalf Of Steffen Mazanek
| Sent: 27 October 2003 21:27
| To: [EMAIL PROTECTED]
| Subject: command line option --show-iface
|
| Hello,
|
| the following error
On Fri, 7 Nov 2003 19:55:47 +0100
Stefan Karrmann [EMAIL PROTECTED] wrote:
I've inserted 'convert = (uncurry cFromTai) . cToTai'.
Great, thanks.
A fixed and checked version is appended and carbon copied to
[EMAIL PROTECTED].
What's haskell-libs-developers? I thought libraries'
PRELIMINARY CALL FOR PAPERS
--
Third International Conference on
Generative Programming and Component Engineering
(GPCE'04)
Is it possible/easy in any of the compilers/interpreters to see what the
results of rewriting/optimisations are? (I'm sure it is *possible*, I'm
really asking if any produce simple output in a well documented format
that I'm likely to understand).
The reason I ask is because I'm curious whether
Is it possible/easy in any of the compilers/interpreters to see what the
results of rewriting/optimisations are? (I'm sure it is *possible*, I'm
really asking if any produce simple output in a well documented format
that I'm likely to understand).
Very easy in GHC. GHC does its
CALL FOR PAPERS
ESSLLI-2004 STUDENT SESSION
9-20 August, 2004 in Nancy,
France
Deadline: February 22, 2004
http://esslli2004.loria.fr/
We are pleased to announce the Student Session of the 16th
EuropeanSummer School in Logic, Language and Information
Thank you for the discussion, but let me ask some more questions:
Simple questions:
1. Is there ssl support for the haskell httpd somewhere?
2. Does this httpd actually build w/ modern GHC?
3. Why doesn't haskell.org run this httpd?
More complex question:
Assumptions:
* This httpd can do 1000
while working on a random project, I had opprotunity to write a 'parallel show'
which concurrently evaluates everything needed to show a structure and lets you
print succesivly refined versions as vaules are calculated and filled in. it is
nice because a value that takes a long time (or perhaps
[EMAIL PROTECTED] writes:
I'm new to haskell and have to do some excersises.
Okay. Thank you for being up-front about it. You got some advice, so
I'll just add that
So i have been trying using any with a helper function
Yep, this is a good way to do it. You may want to consider filter
or
class Thing t where
thing :: t
[..]
Can someone please explain why
fst (1,thing)
...gets an 'ambiguous type variable' error, but
fst (1,undefined)
...doesn't? And is there anything I can change to make the former work
as well? Even modifying fst doesn't work:
This kind of
Jared Warren wrote:
Consider:
class Thing t where
thing :: t
instance Thing Int where
thing = 0
instance Thing Char where
thing = 'a'
Can someone please explain why
fst (1,thing)
...gets an 'ambiguous type variable' error, but
fst (1,undefined)
...doesn't?
Perhaps
I was wondering why System.Posix.Signals is as it is, and whether it could
be rewritten to use exceptions, which seems like the obvious way to handle
signals. Of course, that requires asynchronous exceptions, but that
doesn't seem like a severe problem.
What I currently do is to use the
I just found myself writing some code like this:
processFoo processBar = toFoo . processBar . fromFoo
where
fromFoo foo = ...
toFoo bar = ...
and noticed some similarity in style to certain kinds of transformation
used in linear algebra, such as for
aside
This is almost a reprise of a question that came up back in July [1]. At
the time, Mark Jones posted a reference [2], but I'm not seeing how it is
relevant to this issue of case expressions.
[1] http://haskell.org/pipermail/haskell-cafe/2003-July/004708.html
[2]
So my questions are:
(a) is there a common functional programming pattern that corresponds to
vector space transformations so that a function defined over one space can
be used in another, and
(b) if so, are there any not-too-heavy papers or articles discussing this
pattern?
Many times
22 matches
Mail list logo
