Theoretical Computer Science
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
Imperative functional programming
POPL '93 Proceedings of the 20th 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
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
The Definition of Standard ML
A Calculus for Interaction Nets
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Static Analysis of Interaction Nets for Distributed Implementations
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Coinductive Techniques for Operational Equivalence of Interaction Nets
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Visual Programming with Interaction Nets
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizing monads in interaction nets via generic typed rules
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.01 |
Interaction nets were introduced almost 15 years ago. Since then they have been put forward as both a graphical programming paradigm and as an intermediate language into which we can compile other languages. Whichever way we use interaction nets, a problem remains in that the language is very primitive. Drawing an analogy with functional programming, we have the @l-calculus but we are missing the functional programming language: syntactic sugar, language constructs, data-structures, etc. The purpose of this paper is to make a first step towards defining such a programming language for interaction nets.