## Linear Behaviour Of Term Graph Rewriting Programs (0)

### Cached

### Download Links

- [www.kypros.org]
- [www.cs.ucy.ac.cy]
- [www2.cs.ucy.ac.cy]
- DBLP

### Other Repositories/Bibliography

Venue: | Proc. ACM SAC `95 |

Citations: | 12 - 12 self |

### BibTeX

@INPROCEEDINGS{Banach_linearbehaviour,

author = {Richard Banach and George A. Papadopoulos},

title = {Linear Behaviour Of Term Graph Rewriting Programs},

booktitle = {Proc. ACM SAC `95},

year = {},

pages = {26--28},

publisher = {ACM Press}

}

### OpenURL

### Abstract

The generalised 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 N-to-N 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 generalised 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 im...

### Citations

277 |
A family of concurrent logic programming languages
- Shapiro
- 1989
(Show Context)
Citation Context ...near concurrent language. In particular, we compare the linear version of Append presented in the previous section with the equivalent version written in a state-of-the-art concurrent logic language (=-=[17]-=-) which was translated to MONSTR using the techniques described in [3,13]. The programs were run using the Dactl interpreter ([9]) and exploiting the statistics facilities offered by that implementati... |

133 |
Functional Programming and Parallel Graph Rewriting
- Plasmeijer, Eekelen
- 1993
(Show Context)
Citation Context ... based on TGRSs are suitable as compiler target (intermediate) languages. In particular, a number of specific TGR languages have been developed, all closely related, among which we may mention Clean (=-=[14]), DACTL (-=-[9]), and MONSTR ([2]). The last of these, MONSTR, can be viewed as a subset of DACTL, at least in the syntactic sense, and it is the "machine language" of the distributed architecture Flags... |

48 | ACL–A Concurrent Linear Logic Programming Paradigm
- Kobayashi, Yonezawa
- 1993
(Show Context)
Citation Context ...f computation. The logic and functional programming models have unsurprisingly been prime candidates for such work and in this paper we concentrate on a fragment of LL that is used in such languages (=-=[6,12,15,16,19]-=-). What is perhaps more surprising, is that the implementation problems of distributed parallel TGR, crystallized in the design of the MONSTR language, threw up many questions whose answers turned out... |

32 |
Flagship: a Parallel Architecture for Declarative Programming
- Watson
- 1988
(Show Context)
Citation Context ... be closely related to the criteria forced by linearity, and in a piquant historical coincidence, did so at around the same time. See for instance the work by Watson and Watson ([20]), Watson et al. (=-=[21]-=-), and Banach and Watson ([4]). The smoothness of the translation we present in this paper is concrete evidence for this claim. It should be emphasised here that the purpose of the present work is not... |

21 |
Generative Communication in
- Gelernter
- 1985
(Show Context)
Citation Context ...AL denotes a redex that by convention starts off the computation. MONSTR's insistence that stateholders must be updated atomically allows the modelling of Linda-like generative type of communication (=-=[7]). For instance, the two-=- agents ��L.Receive1(L) --- ( ��M.L:M --- ( ��C.M=m(a,C) -> Consume1(C))) ��L.Receive2(L) --- ( ��M.L:M --- ( ��C,D.M=m(C,D) -> Consume2(C,D))) translated to MONSTR as follows ... |

19 | Parallel SML: a Functional Language and its Implementation in Dactl - Hammond - 1991 |

16 |
An Overview of the Flagship System
- Keane
- 1994
(Show Context)
Citation Context ...CTL ([9]), and MONSTR ([2]). The last of these, MONSTR, can be viewed as a subset of DACTL, at least in the syntactic sense, and it is the "machine language" of the distributed architecture =-=Flagship ([11]-=-). MONSTR will be of considerable concern to us in this paper, being the target of our translation of a fragment of Girard's Linear Logic (LL). More recently, the relationship of TGR to both other par... |

16 |
Evaluating functional programs on the FLAGSHIP machine
- WATSON, WATSON
- 1987
(Show Context)
Citation Context ...on. The concurrent logic version generates 147 nodes, 24 of which are IND ones needed for sharing rewritten packets; this is a standard technique used in implementing languages using graph rewriting (=-=[5,14,19,20,21]-=-). These IND nodes cannot be dispensed with since in a concurrent logic program a data structure may indeed be shared by more than one process. The linear version, on the other hand, generates 100 nod... |

14 | Parallel term graph rewriting and concurrent logic programs
- Banach, Papadopoulos
- 1993
(Show Context)
Citation Context ...of Append presented in the previous section with the equivalent version written in a state-of-the-art concurrent logic language ([17]) which was translated to MONSTR using the techniques described in =-=[3,13]-=-. The programs were run using the Dactl interpreter ([9]) and exploiting the statistics facilities offered by that implementation. Note that what we compare here are the relative differences in the st... |

8 |
A brief introduction to linear concurrent constraint programming. Xerox PARC
- Saraswat
- 1993
(Show Context)
Citation Context ...f computation. The logic and functional programming models have unsurprisingly been prime candidates for such work and in this paper we concentrate on a fragment of LL that is used in such languages (=-=[6,12,15,16,19]-=-). What is perhaps more surprising, is that the implementation problems of distributed parallel TGR, crystallized in the design of the MONSTR language, threw up many questions whose answers turned out... |

7 |
Dealing with State on FLAGSHIP
- Banach, Watson
- 1989
(Show Context)
Citation Context ...teria forced by linearity, and in a piquant historical coincidence, did so at around the same time. See for instance the work by Watson and Watson ([20]), Watson et al. ([21]), and Banach and Watson (=-=[4]-=-). The smoothness of the translation we present in this paper is concrete evidence for this claim. It should be emphasised here that the purpose of the present work is not to describe in detail the im... |

7 | The design and implementation of an actor language based on linear logic - Tse - 1994 |

6 | MONSTR I – fundamental issues and the design of MONSTR. J _ ournal of Universal
- Banach
- 1996
(Show Context)
Citation Context ...compiler target (intermediate) languages. In particular, a number of specific TGR languages have been developed, all closely related, among which we may mention Clean ([14]), DACTL ([9]), and MONSTR (=-=[2]). The las-=-t of these, MONSTR, can be viewed as a subset of DACTL, at least in the syntactic sense, and it is the "machine language" of the distributed architecture Flagship ([11]). MONSTR will be of c... |

6 |
Parallel implementation of concurrent logic languages using graph rewriting techniques
- Papadopoulos
- 1989
(Show Context)
Citation Context ... to use the semantics of stateholders more fully. Indeed, regarding implementation, similar compilers that have been written for mapping a variety of concurrent logic languages onto Dactl and MONSTR (=-=[13,3]-=-) are currently being modified to suit our purposes. The derived code would be able to run on the distributed Flagship machine ([11,20,21]). A final point to note is that intermediate compiler target ... |

4 | Functional programming languages with logical variables: ‰ a linear logic view
- Darlington, Guo, et al.
- 1993
(Show Context)
Citation Context ...f computation. The logic and functional programming models have unsurprisingly been prime candidates for such work and in this paper we concentrate on a fragment of LL that is used in such languages (=-=[6,12,15,16,19]-=-). What is perhaps more surprising, is that the implementation problems of distributed parallel TGR, crystallized in the design of the MONSTR language, threw up many questions whose answers turned out... |

3 |
Dataflow Analysis of Term Graph Rewriting Systems
- Banach
- 1989
(Show Context)
Citation Context ...ng what ought to happen to it. In fact to establish that no function node has a parent in the run-time configuration requires a global analysis of the whole ruleset, although an extremely simple one (=-=[1]-=-). The above run-time configuration can be used to model most of the types of communication using channels: one-to-one (point-to-point), one-to-many (broadcasting) and many-toone are implemented trivi... |

1 |
The Design and Implementation of an Actor
- Tse
- 1994
(Show Context)
Citation Context |

1 | Final Specification of Dactl - Somner - 1988 |