Token-passing Optimal Reduction with Embedded Read-back
Anton Salikhmetov · Electronic Proceedings in Theoretical Computer Science · 2016
We introduce a new interaction net implementation of optimal reduction for the pure untyped lambda calculus. Unlike others, our implementation allows to reach normal form regardless of the interaction net reduction strategy using the approach of so-called token-passing nets and a non-deterministic extension for interaction nets. Another new feature is the read-back mechanism implemented without leaving the formalism of interaction nets.