An interaction net implementation of closed reduction
chapter
posted on 2023-06-08, 13:57authored byIan Mackie
Closed reduction is a very efficient reduction strategy for the lambda calculus, which is explained using a simple form of explicit substitutions. This paper introduces this strategy, and gives an implementation as a system of interaction nets. We obtain one of the most efficient implementations of this kind to date