About the efficient reduction of lambda terms

Abstract

If the argument N gets duplicated and it contains a reducible expression, its reduction will be duplicated too. It may seem that an eager strategy (possibly delayed “on demand”, as in the “call by need” strategy) could solve the job. Unfortunately, this is not the case. Let us consider first the case of weak frameworks. In this case, functions are treated… (More)

Topics

6 Figures and Tables

Cite this paper

@article{Asperti2017AboutTE, title={About the efficient reduction of lambda terms}, author={Andrea Asperti}, journal={CoRR}, year={2017}, volume={abs/1701.04240} }