Implementing interaction nets in MONSTR

Authors:
Richard Banach;George A. Papadopoulos
Affiliations:
Department of Computer Science, University of Manchester, Manchester M13 9PL, U.K.;Department of Computer Science, University of Cyprus, P.O.B. 537, CY-1678, Nicosia, CYPRUS
Venue:
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Year:
1997

Linear logic

Theoretical Computer Science
Flagship: a parallel architecture for declarative programming

ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term graph rewriting: theory and practice

Term graph rewriting: theory and practice
MONSTR: term graph rewriting for parallel machines

Term graph rewriting
Linear behaviour of term graph rewriting programs

SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Dactl: An Experimental Graph Rewriting Language

Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Term graph rewriting as a specification and implementation framework for concurrent object-oriented programming languages

PMMP '95 Proceedings of the conference on Programming Models for Massively Parallel Computers

Hi-index	0.00