About the "Maybe Maybe X" problem: Since Waldek gives the idea of using GENSYM() to mark failure, I want to hear his opinion.
One of my original motives to introduce Maybe is performance, the other motive is better abstraction. Seems we can't have both. If I have to choose between them, I'll choose better abstraction. If we choose "Rep := List R", then the performance should be same as Union(X, "failed"). I did a simple benchmark on subtractIfCan$NNI, the GENSYM() approach can be 12% faster (or 20% faster if a GC happens). That may speed up "groebner" by 4%. I guess if such optimization is really needed, it can be done case by case. -- 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.
