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
A Calculus for Interaction Nets
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
From Functional Programs to Interaction Nets via the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-passing Nets for Functional Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Optimality for dynamic patterns
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Hi-index | 0.00 |
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.