An Algorithm for Translating Lisp Programs into Reduction Language Programs
作者： Alexis Koster
关键词:
摘要: An algorithm for translating LISP programs into reduction language is presented. It allows us to compare some features of the two languages: presence/absence environment, free variables, evaluation rules, and parallelism. may lead efficient execution on a machine.
springer.com
sci-hub.st 参考文章(14)
Erwin Engeler, Symposium on semantics of algorithmic languages ,(1971)
Alexis Koster Vel Kotlarz, Execution time and storage requirements of reduction language programs on a reduction machine. The University of North Carolina at Chapel Hill. ,(1977)
L. Fox, R. M. Burstall, Advances in programming and non-numerical computation ,(1966)
Clark Weissman, LISP 1.5 primer Dickenson Pub. Co.. ,(1967)
Dana Scott, The lattice of flow diagrams Lecture Notes in Mathematics. pp. 311- 366 ,(1971) , 10.1007/BFB0059703
Mark Pozefsky, Programming in reduction languages. The University of North Carolina at Chapel Hill. ,(1977)
Michael J. C. Gordon, Evaluation and denotation of pure LISP programs: a worked example in semantics The University of Edinburgh. ,(1973)
John McCarthy, History of LISP acm sigplan conference on history of programming languages. ,vol. 13, pp. 217- 223 ,(1978) , 10.1145/800025.1198360
John Backus, Programming language semantics and closed applicative languages Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73. pp. 71- 86 ,(1973) , 10.1145/512927.512934
Joel Moses, The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem ACM SIGSAM Bulletin. pp. 13- 27 ,(1970) , 10.1145/1093410.1093411