Eingang zum Volltext
Lizenz

Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende
URN: urn:nbn:de:kobv:83-opus-20005
URL: http://opus.kobv.de/tuberlin/volltexte/2008/2000/

Xing, Cong-Cong

A Graph-Based Type Representation for Objects

pdf-Format:
Dokument 1.pdf (160 KB)

Kurzfassung in Englisch

Subtyping and inheritance are two major issues in the research and development of object-oriented languages, which have been traditionally studied along the lines of typed calculi where types are represented as a combination texts and symbols. wo aspects that are closely related to subtyping and inheritance -- method interdependency, and self type and recursive object type -- have either been overlooked or not received sufficient/satisfactory treatments. In this paper, we propose a graph-based notation for object types and investigate the subtyping and inheritance issues under this new framework. Specifically, we (1) identity the problems that have motivated this paper; (2) propose an extension to Abadi-Cardelli's object-calculus towards fixing the problems; (3) present definitions of object type graphs followed by examples; (4) define subtyping and inheritance using object type graphs; (5) show how the problems can be easily resolved under object type graphs; and (6) summarize the contributions of this paper.

Freie Schlagwörter (englisch): Graph Transformation , object type
Collection TU Berlin / Zeitschriften / Fakultät IV - Elektrotechnik und Informatik / Electronic Communications of the EASST- ECEASST / Volume 10 (2008): Graph Transformation and Visual Modeling Techniques 2008
Institut: Institut für Softwaretechnik und Theoretische Informatik
DDC-Sachgruppe: Informatik
Dokumentart: Aufsatz
Schriftenreihe: Electronic Communications of the EASST- ECEASST
Band Nummer: 10/20
ISBN: 1863-2122
Quelle: http://eceasst.cs.tu-berlin.de/index.php/eceasst/issue/view/19
Sprache: Englisch
Erstellungsjahr: 2008
Publikationsdatum: 28.08.2008
Lizenz: Standardlizenz: Typ CC by-nc-sa - Namensnennung erforderlich | Kommerziell nein | Weiterbearbeitung nur unter gleichen Bedingungen erlaubt | PoD ja