Linear behaviour of term graph rewriting programs
Date
1995Publisher
ACMSource
Proceedings of the ACM Symposium on Applied ComputingProceedings of the 1995 ACM Symposium on Applied Computing
Pages
157163Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
The generalized term graph rewriting computational model is exploited to implement concurrent languages based on Girard's Linear Logic (LL). In particular a fragment of LL is identified which is able to serve as a `process calculus' and on which the design of a number of languages can be based. It is then shown how this fragment can be mapped onto equivalent sets of graph rewriting rules that both preserve the functionality of the LL connectives and also exploit the properties of linearity for efficient implementation on a distributed architecture. Notions such as channels, production and consumption of messages, and NtoN communication between agents, are interpreted in the world of (term) graph rewriting. This work serves two purposes: i) to extend the notion of Term Graph Rewriting as a generalized computational model for the case of linear concurrent languages, and ii) to act as an initial investigation towards a fully linear term graph rewriting model of computation able to be implemented efficiently on distributed architectures.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.

Article
A multimedia programming model based on timed concurrent constraint programming
Papadopoulos, George Angelos (1998)We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of objectoriented timed concurrent constraint programming (OOTCCP). The ...

Article
Asynchronous timed multimedia environments based on the coordination paradigm
Papadopoulos, George Angelos (2003)This paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...

Article
Concurrent objectoriented programming using term graph rewriting techniques
Papadopoulos, George Angelos (1996)The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent objectoriented programming techniques exploiting the fine grain highly parallel features of TGRS in a ...