home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.object
- Path: sparky!uunet!munnari.oz.au!metro!graham
- From: graham@maths.su.oz.au (Graham Matthews)
- Subject: A question of notation
- Message-ID: <graham.711774150@galois>
- Sender: graham@maths.su.oz.au
- Nntp-Posting-Host: galois.maths.su.oz.au
- Organization: Sydney University Computing Service, Sydney, NSW, Australia
- Date: Wed, 22 Jul 1992 03:02:30 GMT
- Lines: 31
-
- We are considering adding some OO type extensions to a
- mathematical programming language developed locally. These
- extensions are fairly straigtforward - my questions does
- not concern them. Rather I have a question about notation.
-
- In a "standard" OO language to invoke method M in object
- O one writes something like,
-
- a = O.M( .. )
-
- Now for historical reasons this kind of notation would not
- fit well with our existing language. The following alternative
- has been proposed
-
- a = M( O, ... )
-
- WITH the definition that the class of the first argument is
- where the search for method M will begin.
-
- Personally I do not like this syntax. But what I was
- wondering is the following: is this only a question of
- syntax or is there some intrinsic weakness in the second
- approach that I cannot see? As far as I can see the two
- approaches are semantically equivalent. Am I overlooking
- something?
-
- graham
- --
- Graham Matthews And it's true we are immune
- Pure Math, Uni.Sydney, Oz When fact is fiction and T.V. is reality
- graham@maths.su.oz.au
-