Hi folks,
I tried to compile the following program with both ghc-3.02 and ghc-4.02
(pathlevel 1), using the linux glibc binary releases. The 3.02 one works
fine but the code produced by 4.02 segmentation faults when I try to run
it.
It uses a c program, which links to code in tcl-tk v8.0.
Dear Mr. Mechveliani,
I thought efficient arrays are impossible in functional language.
I'm not sharing this thought...
Here is a quote from the Haskell Library Report:
\begin{quote}
``Haskell provides indexable arrays, which may be thought of as functions
whose domains are
Concerning 'rapid access' you found in docs - it is hard to believe
this access is as fast as in C array - i mean changing X[i] in array
X. Because when this change is done fast, it is a side effect, breaks
functionality.
I always thought that this is the main cost the functional world pays
for
Date: Fri, 19 Feb 1999 09:41:58 +0100 (MET)
From: Lennart Augustsson [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], [EMAIL PROTECTED],
[EMAIL PROTECTED]
Concerning 'rapid access' you found in docs - it is hard to believe
this access is as fast as in C array - i mean changing X[i] in
I'd like to see the numeric class hierarchy re-organized
along lines suggested by modern algebra. That is,
it should be organized in terms of Groups, Rings,
Fields, etc., instead of Integral, Fractional, Real,
etc. I have no idea how this should look exactly,
so I'll just request it and leave
Don't be shy about using lists when writing Haskell Code. Since Haskell is
lazy, lists are often consumed as they are created, so in many cases they
do not use extra memory. Lists really are the key to clarity AND efficiency.
These definitions are the most efficient of those proposed for the
OK, I'm curious. Two people replied that C++ has undecidable type
checking. I was not aware of this (although I can't say I'm too
surprised); do you have a reference?
It's actually the template processing that can loop, but it is
sort of part of the type checking.
You can find an article
On 18-Feb-1999, Carl R. Witty [EMAIL PROTECTED] wrote:
OK, I'm curious. Two people replied that C++ has undecidable type
checking. I was not aware of this (although I can't say I'm too
surprised); do you have a reference?
Not really. I believe this has been mentioned on comp.std.c++,
but I
Lennart Augustsson writes:
OK, I'm curious. Two people replied that C++ has undecidable type
checking. I was not aware of this (although I can't say I'm too
surprised); do you have a reference?
It's actually the template processing that can loop, but it is
sort of part of the type
Asking on existential types, i wrote
It is required to organise a table with the key
data K = K1 | K2 | K3 ...
to put/extract there the items of different types, say, 'a' and
('a','b') as well. Is this possible?
Understanding nothing in this
On Fri, 19 Feb 1999 01:19:18 -0500
Leon Smith [EMAIL PROTECTED] wrote:
In this particular case, pretty much any Haskell compiler will
automatically perform optimizations that will transform the first
definition into the second definition. So, the first definition will
create the same object
Jose Emilio Labra Gayo wrote:
I agree; Haskell 2 should have existential (and universal) types. I
also think it should have both extensible records and extensible
variants. (See the following paper for more information on these.
TREX is an implementation of half of this system; it
I'm curious: how many people have actually written a program in
Cayenne? How many people have written programs that made significant
use of the dependent typing? Has anybody tried to teach a programming
class using Cayenne?
I'll admit to not having yet written something in Cayenne, but I'm
Do existential types makes algebraic types obsolete?
I mean there seems to be a large semantic overlap between the two
concepts.
For example, once you can implement lists with just the product type (,),
why bother with algebraic types?
Arguably Boolean is a natural algebraic type, but if we
I agree; Haskell 2 should have existential (and universal) types. I
also think it should have both extensible records and extensible
variants. (See the following paper for more information on these.
TREX is an implementation of half of this system; it has the
extensible records but not
15 matches
Mail list logo
