We present a natural implementation of the Krivine machine in interaction nets: one rule for each transition and the usual rules for duplication and erasing. There is only one rule devoted to the so-called administration. This way, we obtain a graphical system encoding λ-calculus weak head reduction that can be extended to a λ-calculus normalizer by encoding left reduction.
['Sylvain Lippi']
The graphical Krivine machine