| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423437 | Electronic Notes in Theoretical Computer Science | 2009 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
