Dear Ralf, Waldek,
Due to other, by far more pressing issues, I'd like to stop work on this thread
for now. I should have put in large letters at the beginning:
This is a theoretical question, no need for action right now.
> I think, I stop here and wait for very concrete use cases of yours.
The concrete use case was to replace the 188 declarations of coerce by a
handful of declarations of CoercibleTo in the SPAD library. I think that this
would make the library more user-friendly, and could be a first step towards
removing i-coerce and i-coerfn.
But I hesitate to write
UnivariatePolynomial(var, R) == with Join(CoercibleTo SUP R,
CoercibleTo Polynomial R,
CoercibleTo DMP([var], R),
CoercibleTo MPOLY([var], R) ...)
This doesn't look right.
Martin
-------------------------------------------------------------------------
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand prize is a trip for two to an Open Source event anywhere in the world
http://moblin-contest.org/redirect.php?banner_id=100&url=/
_______________________________________________
open-axiom-devel mailing list
open-axiom-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/open-axiom-devel
