Loading...
Please wait, while we are loading the content...
Similar Documents
A study of two graph rewriting formalisms: interaction nets and monstr (1996).
| Content Provider | CiteSeerX |
|---|---|
| Author | Banach, R. Papadopoulos, G. A. Nets, Interaction |
| Abstract | Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from multiplicative Linear Logic and feature undirected graph edges, while MONSTR arose from the desire to implement generalised term graph rewriting efficiently on a distributed architecture and utilises directed graph arcs. Both formalisms feature rules with small left hand sides consisting of two main graph nodes. A translation of Interaction Nets into MONSTR is described for both typed and untyped nets, while the impossibility of the opposite translation rests on the fact that net rewriting is always Church-Rosser while MONSTR rewriting isn't. Some extensions to the net formalism suggested by the relationship with MONSTR are discussed, as well as some related implementation issues. Key Words: Graph Rewriting, MONSTR, Interaction Nets. 1 Introduction There are many different kinds of graph that have been studied over the years, and inevitably, people have invented a... |
| File Format | |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Interaction Net Graph Arc Similar Graph Main Graph Node Many Different Kind Small Left Hand Side Feature Undirected Graph Edge Net Rewriting Untyped Net Opposite Translation Rest Multiplicative Linear Logic Net Formalism Generalised Term Graph Formalism Feature Rule Related Implementation Issue Graph Rewriting Distributed Architecture |
| Content Type | Text |
