Premium
A new implementation technique for applicative languages
Author(s) -
Turner D. A.
Publication year - 1979
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380090105
Subject(s) - lisp , computer science , programming language , exploit , interpreter , code (set theory) , common lisp , combinatory logic , theoretical computer science , set (abstract data type) , computer security
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.