home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pmafire!news.dell.com!swrinde!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!fauern!fauna!eirich
- From: eirich@immd4.informatik.uni-erlangen.de (Thomas Eirich)
- Newsgroups: comp.object
- Subject: Run time type checking - efficiency and implementation
- Message-ID: <Bs1zEJ.Mor@immd4.informatik.uni-erlangen.de>
- Date: 27 Jul 92 15:08:43 GMT
- Organization: CSD., University of Erlangen, Germany
- Lines: 31
-
- The OO-languages could be classified by the point of time of their
- type checking. The following table gives an overview:
-
- Type checking | Languages
- -------------------+---------------------------------
- compile time only | C++, ...
- -------------------+---------------------------------
- compile & run time | POOL, BETA, Eiffel, Trellis/Owl,
- (hybrid) | Guide, ...
- -------------------+---------------------------------
- run time only | Smalltalk, CLOS, ...
-
-
- Eiffel e.g. does the type checking of the reverse assignment
- operator (?=) and the validating of the method selectors
- at run-time. Invalid selectors result in errors like
- "message not understood".
-
- I'm interested in the following questions on hybrid type systems:
- a) How is the type information represented at run time?
- b) How efficient is the dispatching of methods and the validation
- of selectors at run time?
-
- Can anyone give me hints to literature or email me details
- of the implementation of run time type checking in hybrid
- type systems (especially the languages mentioned above)?
-
- --
- Thomas Eirich (eirich@informatik.uni-erlangen.de)
- Friedrich-Alexander University (FAU) Erlangen-Nuremberg, Germany
- Department of Computer Science IMMD IV
-