Browsing by Subject "Term graph rewriting"

Now showing items 1-1 of 1

    • Conference Object  

      Implementing interaction nets in MONSTR 

      Banach, Richard; Papadopoulos, George Angelos (Association for Computing Machinery, 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 ...