Re: Re: polynomial ring

Isaac Gouy <[email protected]>
Newsgroups gmane.comp.lang.nice.general
Message-ID <[email protected]>
> abstract interface Ring<T> {
...
> }

> <Ring R, RR, T | R<RR> <: T <: R<RR>>
> class Polynomial<T> implements Ring {
>     T[] e;
...
> }
> 

This is fun! 

Please step through more slowly:
- we can't have 'Ring[] e' because Ring is not a type
- we've said there's some type T; 
- and that type T is a subtype of some other type R that implements the
abstract interface Ring
- and ...


> Apparently, a future version of the type-checker could internally do
> something similar to handle these cases, and you would not even
> notice :-)

In some future version of the type-checker, what sort of thing would we
write for this to be done internally?

__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free web site building tool. Try it!
http://webhosting.yahoo.com/ps/sb/


-------------------------------------------------------
The SF.Net email is sponsored by EclipseCon 2004
Premiere Conference on Open Tools Development and Integration
See the breadth of Eclipse activity. February 3-5 in Anaheim, CA.
http://www.eclipsecon.org/osdn
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.