A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Implementing interaction nets in MONSTR
1997
Proceedings of the 1997 ACM symposium on Applied computing - SAC '97
Preserved Fulltext
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,
doi:10.1145/331697.332340
dblp:conf/sac/BanachP97
fatcat:4idjzmaijzh2vaii7j3wblo6jm