Faster combinator reduction using stock hardware

Abstract

When originally introduced by Turner [I], the S-K combinators seemed a very attractive basis for the execution of functional programs. In current implementations of languages it is becoming increasingly uncommon to find them used, since it has been found that them are many optimization techniques available [I, 31 that rely on illustrated that streamlined implementations of small instruction sets may compete quite well with even competent professionally built implementations of more complicated computational models,