M. Fern'andez and I. Mackie. From term rewriting to generalised interaction nets. volume 1140 of Lect. Notes Comput. Sci., pages 319--333. Springer-- Verlag, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Term Rewriting as Interaction Nets Plus Hyperedge Replacement - Lohrey (1997) (1 citation) (Correct)
....interaction net, see [Laf90] Interaction nets are a generalization of proof nets in linear logic. They are a local and deterministic model of computation, where confluence is guaranteed. The encoding of a restricted class of term rewriting systems into interaction nets was also investigated in [FM96a], see Section 5 for a comparison with our work. The paper is organized as follows. Section 2 introduces the necessary preliminaries. In Section 3.1, we construct the hypergraph rewrite system H(R) mentioned above, whose soundness (correctness) is proved in Section 3.2 (3.3) In Section 4 we ....
....completeness, namely completeness w.r.t applicability can be proven in the works mentioned above. Moreover, our approach incorporates garbage collection via labeled edges. As already mentioned in the introduction, the encoding of term rewriting systems into interaction nets was also studied in [FM96a]. In this paper it is shown that the class of orthogonal, constructor based and match sequential term rewriting systems can be encoded into pure interaction nets. Furthermore, an extension of the interaction net framework is proposed in which every orthogonal constructor based term rewriting ....
[Article contains additional citation context not shown here]
M. Fern'andez and I. Mackie. From term rewriting to generalised interaction nets. volume 1140 of Lect. Notes Comput. Sci., pages 319--333. Springer-- Verlag, 1996.
Coinductive Techniques for Operational Equivalence of.. - Fernandez, Mackie (1998) (1 citation) Self-citation (Fernandez Mackie) (Correct)
....contexts. Amongst other applications, this facilitates proving properties of programs, and gives a sound basis for program optimization. Interaction nets provide an interesting new perspective as both a programming paradigm [9] and an intermediate language for the implementation of other paradigms [5, 12, 4]. Their key feature is that all the operations in particular copying and discarding of data are explicit, thus modeling the main computational content of any program. Although quite a substantial theory of interaction nets has been developed in the literature, no operational account exists ....
.... the computation (including garbage collection and copying of data) Alternatively, they can be seen as an intermediate language other computational paradigms (including higher order languages) can be encoded into interaction nets: proof nets [13] the calculus [12] and term rewriting systems [4]. Interaction nets can thus be thought of as a multi paradigm implementation technique. Below we formalize this system of rewriting. Definition 2.1 (Interaction Net) An interaction net system ( Sigma; IR) is specified by the following data: ffl A set Sigma of agents, each with an arity in N. A ....
Maribel Fernandez and Ian Mackie. From term rewriting to generalised interaction nets. In Proceedings of PLILP'96. Programming Languages: Implementations, Logics, and Programs, number 1140 in LNCS. Springer-Verlag, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC