The title basically says it all. I am referring to the lack of appropriate coerce or convert operations that make it impossible to convert the simpler type to the more complex type with only :: in Spad code.
On the other hand, if I do this in the interpreter: 0::Polynomial(Integer)::Polynomial(Fraction(Integer)) I get the result as expected. Also, the situation is the same with, e.g., UnivariatePolynomial (as with Polynomial). I guess that it's possible to convert between polynomials with such differing coefficient types by disassembling into coefficients, converting coefficients, and then reassembling into a polynomial. But why isn't this built into the library as a coerce or convert operation? Also, how come that the interpreter has this functionality automatically? How is it achieved in the interpreter? Lastly, what is the recommended way to achieve a conversion like this in Spad code? Thanks, Neven -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/CAL%2BbK4MidGwEuX7o8Qb8-eStFU3pme1uq_HS0zrMcxWWCDHOKw%40mail.gmail.com.
