On Thu, Jan 26, 2012 at 2:51 AM, daly <d...@axiom-developer.org> wrote:
[...lots of axiom examples and Sage questions...] Sage, like Axiom, distinguishes between Integers and Rationals with a trivial denominator, has a strong notion of a basering (for matrices, polynomials), etc. You may want to look up coercion and the preparser to answer you questions about how Sage works, but that's getting somewhat offtrack. > So I am suggesting that a clean syntax is possible if > the base ring is associated with the target symbol, not > with the input tokens. That works for Axiom, but for Sage it would this be a large departure from Python, and then we'd also need to invent a syntax for typing anonymous sub-expressions, at which point you might as well use matrix(R, ...). - Robert -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
