|
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
|
|
| |
5
|
BURGE, W.H. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975.
|
| |
6
|
BURSTALL, R.M., COLLINS, J.S., AND POPPLESTONE, R.J. Programming in POP-2. Edinburgh University Press, Edinburgh, Scotland, 1971.
|
| |
7
|
EDDY, G.J., AND GEOR(~EFF, M.P. The implementation of higher-order functions in PASCAL. Computer Science Tech. Rep. TR 33, Monash University, Clayton, Victoria, Australia, 1983.
|
| |
8
|
FODERADO, J.K. The FRANZ LISP manual, opus 33b. University of California, Berkeley, Calif., 1980.
|
| |
9
|
GEORGEFF, M.P. Higher-order functions in PASCAL. In Proceedings of the 4th Australian Computer Science Conference (Brisbane, Australia), 1981.
|
 |
10
|
|
| |
11
|
GEOg(~EFF, M.P., AND BODNAR, S. A simple and efficient implementation of FUNARGS in LISP. AI Center Tech. Note, SRI international, Menlo Park, Calif., 1984.
|
| |
12
|
GEOR(~E~, M.P., AND EDDY, G.J. Functional PASCAL: An extension of PASCAL to higherorder functions. Computer Science Tech. Rep. TR 27, Monash University, Clayton, Victoria, Australia, 1982.
|
| |
13
|
|
| |
14
|
LANDIN, P. The mechanical evaluation of expressions. Computer Journal 6, 4 (1964), 308-320.
|
 |
15
|
|
| |
16
|
L~NoS~.Y, C.H., AND VAN OER MEULEN, S.G. Informal Introduction to ALGOL-80. North- Holland, New York, 1971.
|
 |
17
|
|
 |
18
|
|
| |
19
|
NORI, K., AMMAN, U., JENSEN, K., NAGELI, H., AND JACOBI, C. The Pascal P-compiler implementation notes. 1976.
|
| |
20
|
|
| |
21
|
TOVaETZS:Y. A summary of MAC-LiSP and other documentation provided by M.I.T. with the MAC-LISP system. Massachusetts Institute of Technology, Cambridge, Mass., 1979.
|
| |
22
|
|
REVIEW
"John L. Lowther : Reviewer"
Georgeff's paper describes some schemes by which function-valued expressions
under static scoping can be efficiently evaluated using a variant of SECD
machines, as well as stack machines. One SECD variant transforms expressions
into simple forms
more...
|