Abstract

. In this paper we present a system of interaction that generalises Lafont's interaction nets by allowing computation in several nets in parallel and communication through a state. This framework allows us to represent large classes of term rewriting systems, genuine parallel functions, non-determinism, communication, sharing, and hence can be used to code features from Standard ML and Concurrent ML. 1 Introduction Term rewriting systems can be regarded as a multi-paradigm specification language, or as an abstract model of computation (abstract in the sense that they specify actions but not control; they are free from strategies). Lafont's interaction nets are a graphical framework based on net rewriting which is much closer to a real model of computation in that all the operations are made explicit, including discarding and copying of data. Moreover, interaction nets can be regarded as a distributed model of computation since all reductions are local. In a previous paper [2] we began...

Citations