> Can we construct a Maple parser that will generate Axiom internal > > S-expressions? This would allow us to replace the Axiom input language > > with a Maple input language. Is this useful? Is this better than B#? > > > That look complicated. > My understanding of B# is it will be a smart interpreter that can do as > much type guessing as possible. But if people want to specify type they > should be free to do so.
Well, as long as we're talking about changing the input language so that it is type-free, one thing to consider would be to mimic the Maple language. That would give us a large test suite of programs and examples. It also might be fairly enlightening about the issues, both for us and for Maple. t _______________________________________________ Axiom-developer mailing list Axiom-developer@nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-developer
