The search for a reduction in combinatory logic equivalent to λβ-reduction

Jonathan P. Seldin. The search for a reduction in combinatory logic equivalent to λβ-reduction. Theoretical Computer Science, 412(37):4905-4918, 2011. [doi]

Abstract

Abstract is missing.