Reversible, irreversible and optimal λ-machines

Vincent Danos, Laurent Regnier
1999 Theoretical Computer Science  
Lambda-calculus is the core of functional programming, and many di erent ways to evaluate lambda-terms have been considered. One of the nicest, from the theoretical point of view, is head linear reduction. We compare two ways of implementing that speciÿc evaluation strategy: "Krivine's abstract machine" and the "interaction abstract machine". Runs on those machines stand in a relation which can be accurately described using the call/return symmetry discovered by Asperti and Laneve.
doi:10.1016/s0304-3975(99)00049-3 fatcat:2byx72psmndh7n4l5o34inet3i