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
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
Information and Computation
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
Interaction nets for linear logic
Theoretical Computer Science
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
Closed Reductions in the lambda-Calculus
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Encoding linear logic with interaction combinators
Information and Computation
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Token-Passing Nets: Call-by-Need for Free
Electronic Notes in Theoretical Computer Science (ENTCS)
Call-by-name and call-by-value as token-passing interaction nets
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
| Hi-index | 0.00 |
Interaction nets are a graphical paradigm of computation based on graph rewriting. They have proven to be both useful and enlightening in the encoding of linear logic and the λ-calculus. This paper offers new techniques for the theory of interaction nets, with applications to the encoding of specific strategies in the λ-calculus. In particular we show how to recover the usual call-by-value and call-by-name reduction strategies from general encodings.