Recursive Functions with Pattern Matching in Interaction Nets Export

@article{citeulike:6051820, abstract = {We compile functional languages with pattern-matching features into interaction nets, extending the well-known efficient evaluation strategies developed for the pure λ -calculus. We give direct translations of recursion and pattern matching for languages with a strict matching semantics, implementing an evaluation strategy that is natural in interaction nets and has a high degree of sharing.}, author = {Fern\'{a}ndez, Maribel and Mackie, Ian and Sato, Shinya and Walker, Matthew}, citeulike-article-id = {6051820}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.entcs.2009.10.017}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S157106610900437X}, day = {06}, doi = {10.1016/j.entcs.2009.10.017}, issn = {15710661}, journal = {Electronic Notes in Theoretical Computer Science}, month = {November}, number = {4}, pages = {55--71}, posted-at = {2009-10-31 21:51:33}, title = {Recursive Functions with Pattern Matching in Interaction Nets}, url = {http://dx.doi.org/10.1016/j.entcs.2009.10.017}, volume = {253}, year = {2009} }

TY - JOUR ID - citeulike:6051820 L3 - citeulike-article-id:6051820 N2 - We compile functional languages with pattern-matching features into interaction nets, extending the well-known efficient evaluation strategies developed for the pure λ -calculus. We give direct translations of recursion and pattern matching for languages with a strict matching semantics, implementing an evaluation strategy that is natural in interaction nets and has a high degree of sharing. IS - 4 JF - Electronic Notes in Theoretical Computer Science SN - 15710661 EP - 71 TI - Recursive Functions with Pattern Matching in Interaction Nets VL - 253 SP - 55 AU - Fernández, Maribel AU - Mackie, Ian AU - Sato, Shinya AU - Walker, Matthew PY - 2009/11/06/ UR - http://dx.doi.org/10.1016/j.entcs.2009.10.017 ER -