|
ABSTRACT
A problem common to many powerful programming languages arises when one has to determine what values to assign to free variables in functions. Different implementational approaches which attempt to solve the problem are considered. The discussion concentrates on LISP implementations and points out why most current LISP systems are not as general as the original LISP 1.5 system. Readers not familiar with LISP should be able to read this paper without difficulty since we have tried to couch the argument in ALGOL-like terms as much as possible.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
 |
3
|
|
| |
4
|
P. J. Landin, "A λ-Calculus Approach", in <u>Advances in Programming and Non-Numerical Computation</u>, Pegamon Press, 1966, pp.77--141.
|
 |
5
|
|
| |
6
|
J. Weizenbaum, "The FUNARG Problem Explained", unpublished memorandum, MIT, 1968.
|
CITED BY 16
|
|
|
|
|
U. Honschopp , W. M. Lippe , F. Simon, Compiling functional languages for von Neumann machines, Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems, p.22-27, June 27-29, 1983, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|