Show simple item record

dc.contributor.authorBanach, Richarden
dc.contributor.authorPapadopoulos, George Angelosen
dc.creatorBanach, Richarden
dc.creatorPapadopoulos, George Angelosen
dc.description.abstractThe usefulness of the generalized computational model of Term Graph Rewriting Systems (TGRS) for designing and implementing concurrent object-oriented languages, and also for specifying and reasoning about the interaction between concurrency and object-orientation (such as concurrent synchronization of methods or interference problems between concurrency and inheritance), is examined in this paper by mapping a state-of-the-art functional object-oriented language onto the MONSTR computational model, a restricted form of TGRS specifically designed to act as a point of reference in the design and implementation of declarative and semi-declarative programming languages especially suited for distributed architectures.en
dc.sourceProceedings of the International Conference on Programming Models for Massively Parallel Computersen
dc.sourceProceedings of the 1995 2nd International Conference on Programming Models for Massively Parallel Computersen
dc.subjectParallel processing systemsen
dc.subjectObject oriented programmingen
dc.subjectTerm graph rewriting systemsen
dc.subjectComputational model MONSTRen
dc.subjectComputer hardware description languagesen
dc.titleTerm graph rewriting as a specification and implementation framework for concurrent object-oriented programming languagesen
dc.description.endingpage158 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: IEEEen
dc.description.notesConference code: 44359en
dc.description.notesCited By :1</p>en
dc.contributor.orcidPapadopoulos, George Angelos [0000-0001-9250-4916]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record