Re: LSP and Equal()......

From: Universe (universe_at_tAkEcovadOuT.net)
Date: 06/24/04 

Date: Thu, 24 Jun 2004 01:34:11 -0400

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote:

> On 23 Jun 2004 03:03:25 -0700, Mark Nicholls wrote:
>
> >>>?? you seem to be saying you don't want to consider behaviour, but if
> >>>you do then you can't say anything about behaviour ??
 
> >> I don't want to! The subtype-of is a relation to be defined in
> >> language terms, for type is a language term. On the contrary,
> >> behaviour is something outside the language.

A set of things with Behavior XYZ is a TYPE.

> "Type" is a language term, so should be "subtype".

Any word is a term. How does a thing having a language term limit the
things existence only to language?

> >> Yes it is implemented by
> >> a program written in a language, but to judge about it you need an
> >> intelligence, no compiler possesses.

Sure, we use analysis and synthesis of a domain to evaluate, judge and
compare things with one another and to other things, and thus
determine their TYPE, but one must do that with all types used by a
compiler otherwise one is playing around and incompetent. This
applies to Structured, AI, Functional, OO or any paradigm.

Elliott 

-- 
-- 
Theory Leads, Practice Verifies
----== Posted via Newsfeed.Com - Unlimited-Uncensored-Secure Usenet News==----
http://www.newsfeed.com The #1 Newsgroup Service in the World! >100,000 Newsgroups
---= 19 East/West-Coast Specialized Servers - Total Privacy via Encryption =---