💾 Archived View for dcreager.net › papers › Turner1979.gmi captured on 2024-02-05 at 10:06:19. Gemini links have been rewritten to link to archived content
⬅️ Previous capture (2023-07-22)
-=-=-=-=-=-=-
D. A. Turner. “A new implementation technique for applicative languages”. Journal of Software: Practice and Experience. 9(1). pp 31-49. January 1979.
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.