> AFAICS it is a silly bug in 'subset?'. If we have Set(X) and > X is ordered (like Integer) then w use one algorithm. In > unorderd case we use: > > subset?(s, t) == > #s < #t and every?((x : S) : Boolean +-> member?(x, t), parts s) > > from FiniteSetAggregate. Of course we should have '#s <= #t'.
Wow! That this bug stayed was undetected for sooo many years... Will you commit a fix? I go to bed now. Ralf -- 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 post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
