A Theory of Operational Equivalence for Interaction Nets

  title={A Theory of Operational Equivalence for Interaction Nets},
  author={Maribel Fern{\'a}ndez and Ian Mackie},
The notion of contextual equivalence is fundamental in the theory of programming languages. By setting up a notion of bisimilarity, and showing that it coincides with contextual equivalence, one obtains a simple coinductive proof technique for showing that two programs are equivalent in all contexts. In this paper we apply these (now standard) techniques to interactions nets, a graphical programming language characterized by local reduction. This work generalizes previous studies of operational… 

A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine



Coinductive techniques for operational equivalence of interaction nets

  • Maribel FernándezI. Mackie
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
This paper sets up notions of contextual equivalence and bisimilarity and shows that they coincide, and gives a simple and robust way of showing when two interaction nets are contextually equivalent.

Proving Congruence of Bisimulation in Functional Programming Languages

This work uses this method to show that some generalizations of Abramsky's applicative bisimulation are congruences whenever evaluation can be specified by a certain natural form of structured operational semantics.

A Calculus for Interaction Nets

The purpose of this paper is to study a textual calculus for interaction nets, with a formal operational semantics, which provides a foundation for implementation, and a type system which formalizes the notion of partition used to define semi-simple nets.

YALE: yet another lambda evaluator based on interaction nets

This paper gives a new efficient interaction net encoding of the λ-calculus which is not optimal, but overcomes the inefficiencies caused by the bookkeeping operations in the implementations of optimal reduction.

The geometry of optimal lambda reduction

This paper connects and explains the geometry of interaction and Lamping's graphs, which offer a new understanding of computation, as well as ideas for efficient and correct implementations.

Interaction nets

A new kind of programming language, with the following features: a simple graph rewriting semantics, a complete symmetry between constructors and destructors, and a type discipline for deterministic and deadlock-free (microscopic) parallelism.

Interaction Combinators

It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This

Interaction combinators. Information and Computation

  • 1997

Proving congruence of bisimulation in fu nctional programming languages. Information and Computation

  • 1996

A calculus for interac tion nets

  • InProceedings of the first International Conference on Principles and Practi ce of Declarative Programming (PPDP’99),
  • 1999