Interaction nets
Interaction nets are a low level graphical computation paradigm first proposed by Yves Lafont and based on Jean-Yves Girard's proof nets for linear logic. An interaction net system comprises: a set of agents, each with one principal 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. Compared to traditional term syntax, interaction nets enforce linearity -- each resource is used exactly once --, from which we can derive strong confluence. Thus, they provide a natural language for massive parallelism.
They are also at the heart of the efficient and optimal, in Levy's sense, evaluators for lambda calculus available today.
References
- Yves Lafont: Interaction Nets. POPL 1990: 95-108
- Yves Lafont: Interaction Combinators. Information and Computation 137(1): 69-101 (1997)
External links
- Assisted drawing in LaTeX
- de Falco, Marc. "tikz-inet. A set of tikz-based macros for drawing interaction nets.". See also examples on .
- Software
- Vilaça, Miguel. "INblobs. An editor and interpreter for Interaction Nets". See also on its package on HackageDB.
- de Falco, Marc. "INL. Interaction Nets Laboratory".
This article is issued from Wikipedia - version of the Wednesday, March 30, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.