ANN: signed-multiset-0.1 –
I am pleased to announce the first release of signed-multiset, which implements an abstract datatype for multisets with negative membership.
Th...

Loading...

Release early, release often. Here's a second version:
http://hackage.haskell.org/package/signed-multiset-0.2
Changes:
* Added the func...

Loading...

Signed multisets are unfamiliar to most of us, and I for one
found the paper a little fast-paced. Can you put a bit more
into the documentation...

Loading...

On 4/19/12 7:02 PM, Richard O'Keefe wrote:
> For a specific example, I haven't the faintest intuition about
> what 'map' should do. Suppo...

Loading...

Wren,
>> For a specific example, I haven't the faintest intuition about
>> what 'map' should do. Suppose we have
>> {(k1)...

Loading...

I don't think max would be a good choice, as that would mean that the default multiplicity would have to be negative infinity (the identity elemen...

Loading...

Sjoerd,
>>>> For a specific example, I haven't the faintest intuition about
>>>> what 'map' should do. Suppose we hav...

Loading...

This is not just about map, but it also a problem for the Monoid instance. You are basically adding an extra identity element, 0, to the max monoi...

Loading...

Sjoerd,
> This is not just about map, but it also a problem for the Monoid instance. You are basically adding an extra identity element, 0, ...

Loading...

On 4/23/12 9:18 AM, Stefan Holdermans wrote:
> Sjoerd,
>
>> This is not just about map, but it also a problem for the Monoid instan...

Loading...

Wren, Sjoerd,
>>> This is not just about map, but it also a problem for the Monoid instance. You are basically adding an extra identit...

Loading...

On Apr 25, 2012, at 11:39 AM, Stefan Holdermans wrote:
> The union of two sets is typically defined as the smallest set that is a superset...

Loading...

Sjoerd,
I am sorry, as I already wrote, I decided to deprecate the package.
> [3] defines the union as h(u) = max(f(u), g(u)) where f, g ...

Loading...

On Apr 26, 2012, at 12:54 AM, Stefan Holdermans wrote:
> Sjoerd,
>
> I am sorry, as I already wrote, I decided to deprecate the p...

Loading...

Sjoerd,
>>> [3] defines the union as h(u) = max(f(u), g(u)) where f, g and h are multiplicity functions.
>>
>> Which is...

Loading...

Loading...

Loading...

On Apr 23, 2012, at 3:18 PM, Stefan Holdermans wrote:
> Sjoerd,
>
>> This is not just about map, but it also a problem for the...

Loading...

Sjoerd,
>>> This is not just about map, but it also a problem for the Monoid instance. You are basically adding an extra identity elem...

Loading...

On Apr 23, 2012, at 4:34 PM, Stefan Holdermans wrote:
> Sjoerd,
>
>>>> This is not just about map, but it also a problem...

Loading...

Sjoerd,
>>> Then why would you want that?
>>
>> You don't have to. (SignedMultiset a, additiveUnion, empty) gives you t...

Loading...

On Apr 23, 2012, at 7:04 PM, Stefan Holdermans wrote:
> if this is what people have agreed on to be a sensible semantics for hybrid sets, ...

Loading...

Loading...

Loading...

On 19/04/2012 4:10 AM, Stefan Holdermans wrote:
> Release early, release often. Here's a second version:
>
> http://hackage.haskell...

Loading...

Loading...

Stefan Holdermans <stefan <at> vectorfabrics.com> writes:
> This package provides an efficient implementation of so-called
>...

Loading...

Loading...

On 18 April 2012 14:26, Stefan Holdermans <stefan@...> wrote:
> I am pleased to announce the first release of signed-multiset, which impl...

Loading...

Loading...

Loading...

Powered by Nabble | Edit this page |