==fptools== gmake all --no-print-directory -r;
in /usr/local/pub-bkb/ghc/fptools/ghc/lib/std/cbits
../../../driver/ghc-inplace -O -I../../../includes -I../../../rts -Wall -static-c
system.c -o system.o
system.c:71:
(building cvs top with 4.06)
When compiling CoreUnfold with the -O flag:
ParseIface.hs:6827: Non-exhaustive patterns in case
ciao.
--
Brian Kernighan has an automobile which he helped design.
Unlike most automobiles, it has neither speedometer, nor gas gauge, nor
any of the numerous
| Sorry, I don't know how to explain it basing on the fact that some
| type variable is free - well, the second example shows that it *must*
| be free in order to apply runST. In the first example, although it
| is free, it is tied to the type of ST result, and the type of runST
| requires that
On Sat, 25 Mar 2000, T. D. Stones wrote:
Hello there
I am A 3rd year student at Leicester Uni, and I am doing my project
using Hugs 1.4. I've noticed that things like EOF
What is it you want to do with EOF?
(I need to read a file
aha, so why dont you use readFile :: FilePath - IO
We've had numerous suggestions to add things to Haskell. However in my opinion
many more computer languages (and programs) are ruined by too many features, than
by too few. So here is my own list of things to remove. I realise there is
no chance whatever of it making it into the Haskell
Hi,
Suppose a denotes a type variable.
1.Can I then say: Bool is of type a ?
2. I suppose I can say that True is of type Bool. However True is not
itself a type, isn't it?
I suppose that I cannot say that True is of type a, isn't it ? So True is a
On Mon, 27 Mar 2000, George Russell wrote:
We've had numerous suggestions to add things to Haskell. However in
my opinion many more computer languages (and programs) are ruined by
too many features, than by too few.
I agree with the principle. My conservatism could be seen several times on
The time has come for another "final" :-} word on the low-level API for
Haskell's foreign function interface. It is nothing very deep and most of
it already exists in one form or the other, but I'd like to have some
feedback before I start hacking this into GHC. Additions are proposed in 3
areas:
On 27-Mar-2000, Jan Brosius [EMAIL PROTECTED] wrote:
Hi,
Suppose a denotes a type variable.
1.Can I then say: Bool is of type a ?
No. That would be a category error. `Bool' _is a_ type, but it doesn't
_have a_ type.
Only _values_ have types, but `Bool' is a type, not a value,
On 27-Mar-2000, Sven Panne [EMAIL PROTECTED] wrote:
1) Mapping Haskell types to C types
2) Mapping C types to Haskell types
These two are a good idea.
For prior art, see the `Interfaces.C' package in normative Annex E of
the Ada 95 standard (available via www.ada.org).
3) Byte order
On 28-Mar-2000, Fergus Henderson [EMAIL PROTECTED] wrote:
For prior art, see the `Interfaces.C' package in normative Annex E of
the Ada 95 standard (available via www.ada.org).
Sorry, that URL is not correct. In fact that is the American Dentists Association
(ADA) home page, not the Ada
On 27-Mar-2000, Jan Brosius [EMAIL PROTECTED] wrote:
1. In Haskell there are 2 sorts of variables : variables that range over values of
a specific type and "type variables".
e.g.in fact n = n * fact (n - 1) (the factorial function n ranges over the values
of type Int.
and in the
Mon, 27 Mar 2000 16:15:45 +0200, Sven Panne [EMAIL PROTECTED]
pisze:
The time has come for another "final" :-} word on the low-level API for
Haskell's foreign function interface.
What about the high-level API (apart from C2HS)?
To solve this problem, every Haskell implementation should
Tue, 28 Mar 2000 02:22:46 +1000, Fergus Henderson [EMAIL PROTECTED] pisze:
This mapping assumes that you want the unboxed types in C. What if
you want to pass an unevaluated closure (e.g. so that you can later
pass it back to Haskell and then evaluate it)?
StablePtr is already there.
What
Fergus Henderson wrote:
[...] 1. Mapping Haskell types to C types [...]
This mapping assumes that you want the unboxed types in C.
Yes, C programmers are not that lazy. :-)
What if you want to pass an unevaluated closure (e.g. so that you
can later pass it back to Haskell and then evaluate
Fergus Henderson wrote:
On 28-Mar-2000, Fergus Henderson [EMAIL PROTECTED] wrote:
For prior art, see the `Interfaces.C' package in normative
Annex E of the Ada 95 standard (available via www.ada.org).
Sorry, that URL is not correct. In fact that is the American
Dentists Association
2. I would first like to come back to the type signature
f :: a - b
I can say the type of f is a - b , isn't it?
Well, people often do say that, but it is a little sloppy; if you want
to be precise, it is more correct to say that
Sven Panne [EMAIL PROTECTED] writes:
1) Although the Haskell 98 report states that Char should be a Unicode
character, a plain char is used here. No implementation uses Unicode so
far, and char is what one wants most of the time, anyway.
HBC uses unicode for source. I'm not sure if
Sven Panne [EMAIL PROTECTED] writes:
itself and that compound values are a case for a (un-)marshaling
library. We already have some ideas what this lib should look like
and some slightly differing modules for this exist, see e.g. C-HS,
the MPI binding or HOpenGL. Before a design for this is
Tue, 28 Mar 2000 12:26:34 +1000, Fergus Henderson [EMAIL PROTECTED] pisze:
It would be fine to have a `typedef void *HsStablePtr'. But it is important
that you do not lose static type information when exporting Haskell functions
to C. So a parameter of type `StablePtr Int' on the Haskell
Sven Panne [EMAIL PROTECTED] wrote,
1. Mapping Haskell types to C types
===
Writing C code which gets called via Haskell's FFI is complicated by the
fact that one needs to know the C types corresponding to Haskell's
One such tool is coming up. GHC is producing cost-centre stack logs, which
we feed into Stephen Jarvis's call-graph profile browser. It highlights the
'hot' path for you. It's fantastic!
Our goal is to release it with the next GHC release, but it depends a bit
on Stephen's time.
If this
22 matches
Mail list logo
