 Interaction nets are at the heart of many implementations of the lambda calculus, such as efficient closed reduction and optimal, in Lévy's sense, Lambdascope.Interactions nets are graph-like structures consisting of "agents" and "edges".An agent of type formula_1 and with "arity" formula_2 has one "principal port" and formula_3 "auxiliary ports".