Implementing interaction nets in MONSTR

Richard Banach; George A. Papadopoulos

doi:10.1145/331697.332340

Implementing interaction nets in MONSTR

Richard Banach, George A. Papadopoulos

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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, thus providing an implementation route for the former based on the latter and particularly suited to distributed implementations. © 1997 ACM.

Original language	English
Title of host publication	Proceedings of the ACM Symposium on Applied Computing\|Proc ACM Symp Appl Computing
Publisher	Association for Computing Machinery
Pages	509-514
Number of pages	5
ISBN (Print)	0897918509, 9780897918503
DOIs	https://doi.org/10.1145/331697.332340
Publication status	Published - 1997
Event	1997 ACM Symposium on Applied Computing, SAC 1997 - San Jose, CA Duration: 1 Jul 1997 → … http://dblp.uni-trier.de/db/conf/sac/sac97.html#BanachP97http://dblp.uni-trier.de/rec/bibtex/conf/sac/BanachP97.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sac/BanachP97

Conference

Conference	1997 ACM Symposium on Applied Computing, SAC 1997
City	San Jose, CA
Period	1/07/97 → …
Internet address	http://dblp.uni-trier.de/db/conf/sac/sac97.html#BanachP97http://dblp.uni-trier.de/rec/bibtex/conf/sac/BanachP97.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sac/BanachP97

Keywords

Distributed systems
Interaction nets
MONSTR
Term graph rewriting systems

Access to Document

10.1145/331697.332340

Cite this

@inproceedings{58e2902acddf484fbda566733e6828e0,

title = "Implementing interaction nets in MONSTR",

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, thus providing an implementation route for the former based on the latter and particularly suited to distributed implementations. {\textcopyright} 1997 ACM.",

keywords = "Distributed systems, Interaction nets, MONSTR, Term graph rewriting systems",

author = "Richard Banach and Papadopoulos, {George A.}",

year = "1997",

doi = "10.1145/331697.332340",

language = "English",

isbn = "0897918509",

pages = "509--514",

booktitle = "Proceedings of the ACM Symposium on Applied Computing|Proc ACM Symp Appl Computing",

publisher = "Association for Computing Machinery",

address = "United States",

note = "1997 ACM Symposium on Applied Computing, SAC 1997 ; Conference date: 01-07-1997",

url = "http://dblp.uni-trier.de/db/conf/sac/sac97.html#BanachP97http://dblp.uni-trier.de/rec/bibtex/conf/sac/BanachP97.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sac/BanachP97",

}

TY - GEN

T1 - Implementing interaction nets in MONSTR

AU - Banach, Richard

AU - Papadopoulos, George A.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - Distributed systems

KW - Interaction nets

KW - MONSTR

KW - Term graph rewriting systems

U2 - 10.1145/331697.332340

DO - 10.1145/331697.332340

M3 - Conference contribution

SN - 0897918509

SN - 9780897918503

SP - 509

EP - 514

BT - Proceedings of the ACM Symposium on Applied Computing|Proc ACM Symp Appl Computing

PB - Association for Computing Machinery

T2 - 1997 ACM Symposium on Applied Computing, SAC 1997

Y2 - 1 July 1997

ER -

Implementing interaction nets in MONSTR

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this