A new implementation technique for applicative languages

David A. Turner · Software Practice and Experience · 1979

Abstract It is shown how by using results from combinatory logic an applicative language, such as LISP, can be translated into a form from which all bound variables have been removed. A machine is described which can efficiently execute the resulting code. This implementation is compared with a conventional interpreter and found to have a number of advantages. Of these the most important is that programs which exploit higher order functions to achieve great compactness of expression are executed much more efficiently.

Cited by 610 works. doi:10.1002/spe.4380090105

Authors

References