On Mon, 17 Mar 2008 16:14:42 -0700 (PDT), Eric Hughes wrote:
> My comment earlier today got my mind in a buzz on the topic of partial
> types, so as a form of personal exorcism I wrote a skeleton draft.
[...]
Your draft does not explain why certain sets of types (called partial
here)
cannot form a proper class.
My guess is that any set of types can be associated with a class. The
procedure is a follows. You construct the intersection of the interfaces
of
the types from the set. (The set is countable infinite, so it should be
possible to do) The result is the interface of the root. The relation "S
derived from T" is obviously preserved on the class.
Consequently, generic types (not Ada term, but the meaning is obvious) are
fully equivalent to cl*****. The only difference is that the former do not
have T'Class and thus lack corresponding polymorphic values (class-wides).
IMO the difference is not in the semantics.
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
|
