home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!uknet!doc.ic.ac.uk!agate!spool.mu.edu!yale.edu!ira.uka.de!chx400!bernina!neptune!santas
- From: santas@inf.ethz.ch (Philip Santas)
- Newsgroups: comp.object
- Subject: Re: Basis of OOP
- Message-ID: <1992Nov8.162212.27972@neptune.inf.ethz.ch>
- Date: 8 Nov 92 16:22:12 GMT
- References: <1992Oct23.201526.25996@neptune.inf.ethz.ch> <Bx8pp3.Jru@cantua.canterbury.ac.nz>
- Sender: news@neptune.inf.ethz.ch (Mr News)
- Organization: Dept. Informatik, Swiss Federal Institute of Technology (ETH), Zurich, CH
- Lines: 56
- Nntp-Posting-Host: spica.inf.ethz.ch
-
-
- In article <Bx8pp3.Jru@cantua.canterbury.ac.nz> chisnall@cosc.canterbury.ac.nz (The Technicolour Throw-up) writes:
- >From article <1992Oct23.201526.25996@neptune.inf.ethz.ch>, by santas@inf.ethz.ch (Philip Santas):
- >>
- >> We would be interested to see where in CT, TT, AA, it is written about
- >> virtual methods, method overriding, side-effects and the rest.
- >
- >For CT and method overriding see:
- >
- >"Modelling Multiple Inheritance with Colimits", Huimin Lin and Man-chi Pong,
- >Formal Aspects of Computing (1990) 2, pp 301-311
-
- Please make sure you know what the conversation is about, before
- you post to the net quoting others; here you make, among others,
- the following mistakes:
-
- (a) The conversation was about the question if OOP was influenced by CT.
- Here you quote me out of context and you come with a paper from 1990,
- _decades_ after the first OOLs appeared. Come up with a relevant paper
- from the 60s and then we discuss it.
-
- (b) In OOP method overriding makes sense in the case of mutable objects.
- Otherwise it is a trivial technic, which exists even in FP (for instance:
- functions defined for more special arguments), and is well documented.
- The problems arise with side effects, and I would be glad/thankful if you
- show me a paper which documents and justifies this case.
-
- (c) Method overriding does not pose _just_ problems of correctnes, but
- of program execution issues as well. These problems are well known
- to the field of symbolic algebra, since proper running of algorithms
- is a great issue. Unfortunately CT or algebra in general does not help
- much here (even _if_ it had solved (b)).
-
- As you see the problem is quite complicated: OOP exists _before_
- its documentation, while on the other hand FP is based on certain
- well known and elaborated mathematical models. Or think about this:
- how many students learn about CT before they learn OOP? (comparison with
- \lambda calculus and FP). This does not imply that the one is inferior to
- the other, it is mentioned just to show that OOP is not based on _any_
- mathematical model.
-
- >Just my two rubber ningis worth.
-
- For what?
-
- Philip Santas
-
- "In an evolving universe those who stand still are really moving backwards"
- --------------------------------------------------------------------------------
- email: santas@inf.ethz.ch Philip Santas
- Mail: Dept. Informatik Department of Computer Science
- ETH-Zentrum Swiss Federal Institute of Technology
- CH-8092 Zurich Zurich, Switzerland
- Switzerland
- Phone: +41-1-2547391
-
-