On the correspondence of lambda style reduction and combinator style reduction

Abstract

A unifying model for lambda style reduction and combinator style reduction is presented. Both reduction types will be described as tree transforming mechanisms thus avoiding as many of the usual implementation details as possible. It will be shown that there is a very strong correspondence between the two reduction mechanisms. This correspondence offers a basis for a fair comparison of the complexities of both mechanisms.