Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
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
Research topics in functional programming
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
The geometry of interaction machine
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Sharing Continuations: Proofnets for Languages with Explicit Control
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Sequential and Concurrent Abstract Machines for Interaction Nets
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Parallel Evaluation of Interaction Nets with MPINE
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
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
Operational equivalence for interaction nets
Theoretical Computer Science - Latin American theoretical informatics
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
From Functional Programs to Interaction Nets via the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-Order and Symbolic Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Interaction Nets With Nested Pattern Matching
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-passing Nets for Functional Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
An Explicit Framework for Interaction Nets
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Recursive Functions with Pattern Matching in Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Compilation of Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding an Object Calculus into Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Supporting Function Calls within PELCR
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-Passing Nets: Call-by-Need for Free
Electronic Notes in Theoretical Computer Science (ENTCS)
An interaction net implementation of closed reduction
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
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
Encoding strategies in the lambda calculus with interaction nets
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
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
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
| Hi-index | 0.00 |
Interaction nets provide a graphical paradigm of computation based on net rewriting. They have proved most successful in understanding the dynamics of reduction in the λ-calculus, where the prime example is the implementation of optimal reduction for the λ-calculus (Lamping's algorithm), given by Gonthier, Abadi and Lévy. However, efficient implementations of optimal reduction have had to break away from the interaction net paradigm. In this paper we give a new efficient interaction net encoding of the λ-calculus which is not optimal, but overcomes the inefficiencies caused by the bookkeeping operations in the implementations of optimal reduction. We believe that this implementation of the λ-calculus could provide the basis for highly efficient implementations of functional languages.