Re: Re: polynomial ring

<Ring R, RR, T | R<RR> <: T <: R<RR>>
class Polynomial<T> implements Ring {

> That T is equal (subtype and supertype) to R<RR>, where R is any
> class that implements Ring, and RR is any type.

Seems like my naive (incorrect) reading of T <: X has been analogous to
T < X rather than T <= X. 


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

> abstract interface Ring { ... }
> class Polynomial<T> implements Ring { ... }

Yes, we need to be able to have different numbers of type parameters to
prevent changes rippling when we add a subclass.

Daniel, thank you.


__________________________________
Do you Yahoo!?
Yahoo! Finance: Get your refund fast by filing online.
http://taxes.yahoo.com/filing.html


-------------------------------------------------------
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