On 04/05/2015 12:19 AM, Waldek Hebisch wrote: > Hmm, why not: > > Eltable(S : Type, Index : Type) : Category == with
In fact, as I continued to generalize TableAggregate, I came to the same conclusion, even though I had (like Bill) some conceptual problems with S not having equality. See top commit here: https://github.com/hemmecke/fricas/commits/generalize-tableaggregate I don't know whether it's the best possible, but at least, it compiles. Whether we still want to have it after Bill now seems to follow my first suggestion of having something like InnerKernel, is another question. In general I agree with Waldek that categories shouldn't have too many requirements for their arguments. And as for Eltable(A,B), yes, mathematically it sounds a bit odd that one can have a function elt: (%, A) -> B even though one doesn't know whether the elements of A can be distinguished via equality or not. But on the other hand, look at a monoid M. It can be considered as a category with just one object X, where the morphisms are the elements of M. Bill knows certainly enough category theory to see that there is no need for equality on X to know what the arrow m: X -> X (m \in M) is. 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.
