A new implementation technique for applicative languages
A new implementation technique for applicative languages
复制标题
一种新的应用语言实现技术
DOI：
--
复制
发表时间：
1979
期刊：
影响因子：
--
通讯作者：
D. Turner
中科院分区：
文献类型：
--
作者：
D. Turner
演示了如何通过使用组合逻辑的结果，将应用语言（如LISP）转换为删除所有绑定变量的形式。描述了一种能够有效地执行结果代码的机器。将此实现与传统解释器进行比较，发现它具有许多优点。其中最重要的是，利用高阶函数来实现表达式紧密性的程序执行效率要高得多。
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.