Yes, I know functional languages are memory hogs, but really!
The following is on linux
# ghci
___ ___ _
/ _ \ /\ /\/ __(_)
/ /_\// /_/ / / | | GHC Interactive, version 6.0, for Hask
/ /_\\/ __ / /___| | http://www.haskell.org/ghc/
\/\/ /_/\/|_| Type :?
I believe I've fixed this one.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On
| Behalf Of Simon Marlow
| Sent: 04 June 2003 11:00
| To: George Russell; [EMAIL PROTECTED]
| Subject: RE: ghc --make and missing interface files
|
|
| Hello all, I have a
FYI:
On page http://www.haskell.org/ghc/ the text The Haskell Wish List is
linked to
http://www.pms.informatik.uni-muenchen.de/forschung/haskell-wish-list/.
That page is woefully out of date; in particular, access to the wish
list fails.
___
On 16 Jun 2003 16:59:07 +0900
Jens Petersen [EMAIL PROTECTED] wrote:
Did anyone ever manage to get gtk2hs working with ghci-5.04.3?
When I try to load it I get:
% ghci-5.04.3 -package gtk2
:
Loading package data ... linking ... done.
Loading package gtk2 ...
GHCi runtime linker: fatal
Hi,
In the ghc manual I read :
How do I find out a function's strictness?
Don't guess-look it up.
Look for your function in the interface file, then for the third field in the
pragma; it should say __S string. The string gives the strictness of the
function's arguments. L is lazy (bad), S
| If you use Simon PJ's type signatures, you can't really disallow using
| a key from one map with another map.
Yes, that's a good point. So there are really three issues:
a) single-threaded-ness
b) making sure you look up in the right map
c) making sure the thing you
Yes, that's a good point. So there are really three issues:
a) single-threaded-ness
b) making sure you look up in the right map
c) making sure the thing you find has the right type
Even if you have typed keys, (Key a), then if you look them up in the
wrong map, any
George Russell writes:
So what does the function
insert2 val1 val2 =
let
(m1,k1) = insert empty (Just val1)
(m2,k2) = insert m1 (Just val2)
m3 = update m2 k1 Nothing
in
isJust (lookup m3 k2)
return? It looks to me as if it
Keith Wansbrough wrote (snipped)
I think I'm missing something... why is this? Do you only allow one
value of each type? It seems to me that updating k1's value should
not affect k2's.
Perhaps you could explain what insert is meant to do, since it doesn't
cite a key value.
I'm
Typically, such functions are often used to implement mappings from
something (such as a String) to something else.
If that is what you want take a look at the type FiniteMap under the
Data area of GHC and HUGS. It implements all the needed functionality
without having to worry about creating a
I'd like to make a haskell binding for a C++ library. Most of the tools
out there seem oriented towards c bindings, so it looks like I'll be
writing the FFI code generator myself. While I'm at it I figure I might
as well just make a general C++ binding tool. I've been thinking about
this, and
On Mon, 16 Jun 2003 [EMAIL PROTECTED] wrote:
Thanks anyway, but I want to maintain a set of elements of some (fixed)
unknown type. In a hash table, I can see in O(1) aprox. if the element
belongs or not to set.
Typically, such functions are often used to implement mappings from
something (such
MR. JOSEPH MAKALE
DEPARTMENT OF MINERALS AND ENERGY
PRETORIA, SOUTH AFRICA.
JUNE16TH., 2003
Sir,
It is my great pleasure to write you this letter on behalf of my colleagues.
Your information was given to me by a member of the South African Export
Promotion Council (SAEPC) who was with the
13 matches
Mail list logo
