Implementing interaction nets in MONSTR
Papadopoulos, George Angelos
PublisherAssociation for Computing Machinery
SourceProceedings of the ACM Symposium on Applied Computing
1997 ACM Symposium on Applied Computing, SAC 1997
Google Scholar check
MetadataShow full item record
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, thus providing an implementation route for the former based on the latter and particularly suited to distributed implementations. © 1997 ACM.