On Thu, Aug 26, 2021 at 09:07:58AM -0400, Bill Page wrote:
> Waldek wrote:
>
> > It still uses order to find positions in kernel cache.
>
> Although order is at least to some extent arbitrary, it is still
> necessary for the ordering to be consistent during a session to
> satisfy category 'Comparable'.
On kernels, once kernel is in cache order is determined by
position, so it is consistent. Beyond kernels it quickly
gets unsound. I am affraid that we either need to declare
that "Comparable" is unsound (that is useful for ordering
printouts, but not much more) or drop "Comparable" from
"Expression" and similar domains.
BTW: When kernel is not in the cache, our code uses order
to find position. But if ordering predicate gives wrong
results we still insert kernel somewhere, possibly in
"wrong" position.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/20210826135931.GC4957%40math.uni.wroc.pl.
