I have a need for an algorithm to perform "subsumption" on partially
ordered sets of values. That is, given a selection of values from a
partially ordered set, remove all values from the collection that are less
than some other member of the collection.
Below is some code I have written, which
Graham Klyne writes:
:
| Below is some code I have written, which works, but I'm not sure
| that it's especially efficient or elegant. Are there any published
| Haskell libraries that contain something like this?
Hi.
Partially ordered sets are in cahoots with lattices, so you may be
interest
> I have a need for an algorithm to perform "subsumption" on partially
> ordered sets of values. That is, given a selection of values from a
> partially ordered set, remove all values from the collection that
> are less than some other member of the collection.
That is, you want the maxima, right?
At 21:18 17/11/03 +0100, [EMAIL PROTECTED] wrote:
> I have a need for an algorithm to perform "subsumption" on partially
> ordered sets of values. That is, given a selection of values from a
> partially ordered set, remove all values from the collection that
> are less than some other member of the
At 09:14 18/11/03 +1300, Tom Pledger wrote:
Graham Klyne writes:
:
| Below is some code I have written, which works, but I'm not sure
| that it's especially efficient or elegant. Are there any published
| Haskell libraries that contain something like this?
Hi.
Partially ordered sets are in ca
