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
Lambda-calculus, types and models
Lambda-calculus, types and models
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
Information and Computation
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Encoding linear logic with interaction combinators
Information and Computation
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We present a natural implementation of the Krivine machine ininteraction nets: one rule for each transition and the usual rulesfor duplication and erasing. There is only one rule devoted to theso-called administration. This way, we obtain a graphicalsystem encoding λ-calculus weak head reduction thatcan be extended to a λ-calculus normalizer byencoding left reduction.