Encoding strategies in the lambda calculus with interaction nets
presentation
posted on 2023-06-08, 09:49authored byIan Mackie
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.