Interaction Net Implementation of Additive and Multiplicative Structures Export

@article{citeulike:328039, abstract = {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 lambda-calculus, where very efficient evaluators have been obtained. Most work in this area is heavily based on the pure lambda-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 lambda-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.}, author = {Mackie, Ian}, citeulike-article-id = {328039}, citeulike-linkout-0 = {http://logcom.oxfordjournals.org/cgi/content/abstract/15/2/219}, journal = {Journal of Logic and Computation}, keywords = {functional-programming, lambda-calculus, linear-logic, optimal-reduction}, number = {2}, pages = {219--237}, posted-at = {2005-09-21 12:47:34}, priority = {1}, publisher = {Oxford University Press}, title = {Interaction Net Implementation of Additive and Multiplicative Structures}, url = {http://logcom.oxfordjournals.org/cgi/content/abstract/15/2/219}, volume = {15}, year = {2005} }

TY - JOUR ID - citeulike:328039 L3 - citeulike-article-id:328039 N2 - 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 lambda-calculus, where very efficient evaluators have been obtained. Most work in this area is heavily based on the pure lambda-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 lambda-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. IS - 2 JF - Journal of Logic and Computation EP - 237 TI - Interaction Net Implementation of Additive and Multiplicative Structures PB - Oxford University Press VL - 15 SP - 219 KW - functional-programming KW - lambda-calculus KW - linear-logic KW - optimal-reduction AU - Mackie, Ian PY - 2005/// UR - http://logcom.oxfordjournals.org/cgi/content/abstract/15/2/219 ER -