Interaction Net Implementation of Additive and Multiplicative Structures
Ian Mackie · Journal of Logic and Computation · 2005
Interaction nets provide a graphical paradigm of computation based on net rewriting. They have proved most successful in understanding the dynamics of reduction in the λ-calculus, where very efficient evaluators have been obtained. Most work in this area is heavily based on the pure λ-calculus, and a general theory of coding data structures with interaction nets has not been forthcoming. The purpose of this paper is to show how all of these systems encoding the λ-calculus can be extended to work with different kinds of data structures, which is a first step towards using these evaluators as the basis of implementation of a richer programming language.