Interaction nets
From Wikipedia, the free encyclopedia
 |
This article may require cleanup to meet Wikipedia's quality standards. Please discuss this issue on the talk page or replace this tag with a more specific message. This article has been tagged since January 2007. |
Interaction nets are a low level graphical computation paradigm first proposed by Lafont and based on Girard's proof nets for linear logic. An interaction net system comprises: a set of agents, each with one principle port and zero or more auxiliary ports; a set of rules between agents (there is at most one rule for every pair of agents); and a net on which the rules are to be applied. Interaction nets are strongly confluent and make good use of resource sharing. They are also at the heart of the most efficient and optimal lambda calculus evaluators available today.
