[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [Axiom-developer] B#

**From**: |
Gabriel Dos Reis |

**Subject**: |
Re: [Axiom-developer] B# |

**Date**: |
24 Mar 2006 10:23:56 +0100 |

root <address@hidden> 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

**Re: [Axiom-developer] B#**, *(continued)*
**Re: [Axiom-developer] B#**, *root*, `2006/03/22`
**Re: [Axiom-developer] B#**, *Gabriel Dos Reis*, `2006/03/22`
**RE: [Axiom-developer] B#**, *Bill Page*, `2006/03/22`
**Re: [Axiom-developer] B#**, *root*, `2006/03/22`
**RE: [Axiom-developer] B#**, *Bill Page*, `2006/03/22`
**RE: [Axiom-developer] B#**, *C Y*, `2006/03/23`
**RE: [Axiom-developer] B#**, *Bill Page*, `2006/03/27`
**Re: [Axiom-developer] B#**, *root*, `2006/03/23`

**RE: [Axiom-developer] B#**, *Page, Bill*, `2006/03/23`
**RE: [Axiom-developer] B#**, *Page, Bill*, `2006/03/23`
**RE: [Axiom-developer] B#**, *Page, Bill*, `2006/03/24`
**RE: [Axiom-developer] B#**, *Page, Bill*, `2006/03/24`