A new implementation technique for applicative languages

doi:10.1002/spe.4380090105

A new implementation technique for applicative languages

2006-10-27

0

PRE

AI

DOI：10.1002/spe.4380090105

原文链接

原文求助

摘要

En 中文

AbstractIt 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.

A new implementation technique for applicative languages

摘要

AI总结

期刊

机构

引用论文