Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424026 | Electronic Notes in Theoretical Computer Science | 2007 | 18 Pages |
Abstract
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, where pattern-matching and 'traditional' β-reduction can proceed in parallel without overheads.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics