ISR 2008

3rd International School on Rewriting

21 – 26 July 2008, Obergurgl, Austria

Program – Track B – Theory and Applications of Interaction Nets


Ian Mackie


Interaction nets are a very restricted form of graph rewriting which are Turing complete. They are of interest computationally because all the computation steps are explicit within the formalism (no external copying or erasing machinery). Rewrite steps can take place in any order, even in parallel, which makes them well-suited for the implementation of programming languages and other rewriting formalisms. The purpose of these lectures is to give an introduction and overview to some of the theory and applications of interaction nets.