This is a multi-part message in MIME format.
--D60EAED940B337DE04784023
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Kevin Atkinson wrote:
> The file Main.hs contains a small test script demonstrating how
> PrimArrays can be faster than arrays with boun
This is a multi-part message in MIME format.
--EBB527FEAD30E684DE2E6D05
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Here is begginings of my second attempt for an STL like library for
Haskell. The only think this version has is Arrays however I plan to
> But how important is having a fold well defined. For many common
> numerical operations such as summing a list, taking the product of a
> list, etc. The order in which the elements get folded does not matter.
> All that matters is that each element gets represented exactly once.
>From an algeb
Me:
>> There is another good reason to have a total order: it makes reduction
>> operations (folds) over the structure well-defined.
Kevin Atkinson:
>But how important is having a fold well defined. For many common
>numerical operations such as summing a list, taking the product of a
>list, etc.
Bjorn Lisper wrote:
>
> There is another good reason to have a total order: it makes reduction
> operations (folds) over the structure well-defined.
But how important is having a fold well defined. For many common
numerical operations such as summing a list, taking the product of a
list, etc. T
At 10:59 +0200 1999/04/29, Bjorn Lisper wrote:
>Just a final comment on total orders on sets: this makes sense, as regards
>operations where the order is important for the semantics, only if the
>elements of the set are drawn from an enumerable set. It would not be very
>sensible to, for instance,
Hans Aberg:
>The total order is needed in order to make the balanced trees used for the
>sets/maps. So what I have in my mind is that somehow Haskell produces a
>default total order on elements. This could be the declaration order or an
>alphabetical order, or whatever (and it is nice to humans t
At 20:12 + 1999/04/27, Kevin Atkinson wrote:
>> So one defines a global total order on the elements of all classes and
>> instances, which then can be used to create maps and sets which are
>> balanced trees, just as in C++ STL. This total order is normally different
>> from any derivation of
At 15:12 -0500 1999/04/28, Michael Hobbs wrote:
>> The main point though is that the total order exists, and is a sorting
>> order separate from the Ord derivation.
>
>Sounds very much like treaps, where a random number is assigned to each
>value when it is placed in the tree. I suspect that this
At 05:47 -0700 1999/04/28, Simon Peyton-Jones wrote:
>Chris Okasaki is working on just such a thing.
>He'll be ready soon...
Well, I think that it (such a total order and map and set structures)
should be integrated into Haskell for efficiency reasons, both of the
implementation and the users.
Simon Peyton-Jones wrote:
>
> Chris Okasaki is working on just such a thing.
> He'll be ready soon...
Could you give me a link to a working URL? The one off of the haskell
library page is dead and the links to the doc. and source code off of
http://www.cs.columbia.edu/~cdo/edison/ also don't wo
Simon Peyton-Jones wrote:
> Chris Okasaki is working on just such a thing.
> He'll be ready soon...
Lest this be taken too literally however, let me clarify.
I am working on the "Containers" part of the "Containers
and Algorithms" that Kevin asked about. I am *not*
doing anything like the "Algo
On 27-Apr-1999, Hans Aberg <[EMAIL PROTECTED]> wrote:
> >Has anyone done any work on comings up with an STL like collection of
> >Containers and Algorithms for Haskell.
> >
> >In partially I would like to see the following containers:
> >
> >Hash map, set, and bags which behave like arrays do.
> >
Chris Okasaki is working on just such a thing.
He'll be ready soon...
Simon
> -Original Message-
> From: Kevin Atkinson [mailto:[EMAIL PROTECTED]]
> Sent: Tuesday, April 27, 1999 5:20 PM
> To: [EMAIL PROTECTED]
> Subject: STL Like Library For Haskell
>
>
>
At 20:12 + 1999/04/27, Kevin Atkinson wrote:
>> So one defines a global total order on the elements of all classes and
>> instances, which then can be used to create maps and sets which are
>> balanced trees, just as in C++ STL. This total order is normally different
>> from any derivation of
Hans Aberg wrote:
>
> >Has anyone done any work on comings up with an STL like collection of
> >Containers and Algorithms for Haskell.
> >
> >In partially I would like to see the following containers:
> >
> >Hash map, set, and bags which behave like arrays do.
> >Truly mutable hash map set and ba
>Has anyone done any work on comings up with an STL like collection of
>Containers and Algorithms for Haskell.
>
>In partially I would like to see the following containers:
>
>Hash map, set, and bags which behave like arrays do.
>Truly mutable hash map set and bags.
>Truly mutable arrays and refer
Has anyone done any work on comings up with an STL like collection of
Containers and Algorithms for Haskell.
In partially I would like to see the following containers:
Hash map, set, and bags which behave like arrays do.
Truly mutable hash map set and bags.
Truly mutable arrays and references.
O
18 matches
Mail list logo
