Name
Abstract | ||
|---|---|---|
We compile functional languages with pattern-matching features into interaction nets, extending the well-known efficient evaluation strategies developed for the pure @l-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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.entcs.2009.10.017 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
high degree,strict matching semantics,interaction net,evaluation strategy,functional language,interaction nets,pattern matching,direct translation,recursive functions,well-known efficient evaluation strategy,pattern-matching feature,recursion | Evaluation strategy,Discrete mathematics,Programming language,Interaction nets,Functional programming,Computer science,Compiler,Theoretical computer science,Mutual recursion,Pattern matching,Semantics,Recursion | Journal |
Volume | Issue | ISSN |
253 | 4 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
6 | 0.47 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maribel Fernández | 1 | 315 | 23.44 |
| Ian Mackie | 2 | 88 | 9.58 |
| Shinya Sato | 3 | 29 | 4.86 |
| Matthew Walker | 4 | 6 | 0.47 |