>
> I have a few patches for aggcat.spad, but one category at a time.
>
> First, child? only uses '=', so BasicType is enough.
> child? in RecursiveAggregate requires BasicType.
>
> Second, '=' are defined for the finite case, so a requirement of
> 'if % has finiteAggregate and S has BasicType' is reasonable.
> While the previous SetAggregate is unreasonable: no function
> from SetAggregate is used.
>
> Third, coerce to OutputForm requires CoercibleTo OutputForm,
> not SetCategory, see all the other implementations of coerce
> in aggcat.spad.
Looks good. But AFAICS coerce to OutputForm needs finiteAggregate,
otherwise we get infinite recursion (actually, as discussed in
case of lists we need stronger property, but ATM finiteAggregate
is reasonable approximation).
--
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 post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
