Implementing interaction nets in MONSTR
Richard Banach, George Angelos Papadopoulos · 1997
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. Keywords: Term Graph Rewriting Systems; MONSTR; Interaction Nets; Distributed Systems. INTRODUCTION There are many different kinds of graph that have been studied over the years, and inevitably, people have invented a rather large number of ways of rewriting them, yielding a vast number of different models of computation. In this paper we study the relationship between t...