POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Interaction nets and term-rewriting systems
Theoretical Computer Science - Special issue: trees in algebra and programming
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Interaction Net Implementation of Additive and Multiplicative Structures
Journal of Logic and Computation
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
A ρ-Calculus of Explicit Constraint Application
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Recursive Functions with Pattern Matching in Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
We use the @r-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the @r-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, where pattern-matching and 'traditional'@b-reduction can proceed in parallel without overheads.