| G. A. Papadopoulos, Object-Oriented Term Graph Rewriting, to be submitted for publication, 1995. |
....We have presented a highly parallel execution model for Object Oriented Concurrent Constraint Programs using as a common uniform formalism the Term Graph Rewriting computational model. The approach we have used to support Object Oriented Programming techniques complements the one we propose in [19] where we introduce records. It is also closely related to the LO model proposed in ( 1] however, our model is effectively a subset of that one and restricts computation within a single context (being similar in this sense to the model proposed in [11] As far as Concurrent Constraint ....
G. A. Papadopoulos, Object-Oriented Term Graph Rewriting, to be submitted for publication, 1995.
No context found.
Papadopoulos, G.A., 1997, Object-Oriented Term Graph Rewriting, International Journal of Computer Systems Science and Engineering, CRL Publs., (in print).
.... languages ( 24,28] eager concurrent logic languages ( 20,33] or combinations of them ( 21] Furthermore, recent studies have shown that TGRS are able to act as a means for implementing languages based on computational models such as Linear Logic ( 5] p calculus ( 3,16] and OOP ([34]) In addition, the implementation of TGRS themselves on a variety of (data flow and graph rewriting) machines such as Alice ( 12] Flagship ( 27,43] and GRIP ( 35] has been extensively studied. The figure above is a modification of the previous one for Dactl. For more information on TGRS the ....
G. A. Papadopoulos, "Object-Oriented Term Graph Rewriting", International Journal of Computer Systems Science and Engineering, CRL Publs., 1997 (in print).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC