An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
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
Hi-index | 0.00 |
This paper is about a new implementation technique for interaction nets - a visual programming language based on graph rewriting. We compile interaction nets to C, which offers a robust and efficient implementation, in addition to portability. In the presentation of this work we extend the interaction net programming paradigm to introduce a number of features which make it a practical programming language.