root <[EMAIL PROTECTED]> writes: [...]
| we would probably get further faster by working out the exact | coercion/conversion graph and formalizing the mechanism. then we could | make the interpreter smarter as well as extend it to special domains | (e.g. to interval arithmetic which does not preserve the distributive | property). Thanks you pointed out this. It is a very fundamental issue. I have been asking myself: "But this B# thingy smells much like ML/Haskell and its descendent, but where are the type conversions formally defined?" I've read Weber's and Doye's contributions; I have the distinct feeling I'm still missing the "big picture", i.e. the picture is still incomplete. -- Gaby _______________________________________________ Axiom-developer mailing list Axiom-developer@nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-developer
