Abstract
An algorithm for translating LISP programs into reduction language programs is presented. It allows us to compare some features of the two languages: presence/absence of environment, free variables, evaluation rules, and parallelism. It may lead to efficient execution of LISP programs on a reduction machine.
Chapter PDF
Similar content being viewed by others
Bibliography
Backus, J. 1972. Reduction Languages and Variable-free programming. IBM Research Report RJ 1010. (IBM Research Laboratory, San Jose, California)
Backus, J. 1973. Programming Language Semantics and Closed Applicative Languages. Conference Record of ACM Symposium on Principles of Programming Languages (Boston)
Backus, J. 1978. Can Programming Be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs. Communications of ACM, 21, 8, pp. 613–641.
Gordon, M. 1973. Evaluation and denotation of pure LISP programs: a worked example in semantics. (Ph.D. Thesis, University of Edinburgh)
Koster, A. 1977. Execution Time and Storage Requirements of Reduction Language Programs on a Reduction Machine. (Ph.D. Thesis, University of North Carolina at Chapel Hill)
Koster, A. 1978. An Algorithm for Translating LISP Programs into Reduction Language Programs. Technical Report TR-78-011. (University of North Carolina at Chapel Hill)
Landin, P. 1964. The Mechanical Evaluation of Expressions. Computer Journal, 6, pp. 308–324
Landin, P. 1966. A Lambda-Calculus Approach. Advances in Programming and Non-Numerical Computations, L. Fox, ed. (Pergamon Press, New York)
Mago, G. 1979. A Network of Microprocessors to Execute Reduction Languages. International Journal of Computer and Information Sciences, 8, 5&6
McCarthy, J. et al. 1965. LISP 1.5 Programmer Manual. (MIT Press, MIT, Cambridge, Massachusetts)
McCarthy, J. 1978. History of LISP. Sigplan Notices, 13, 8, pp. 217–223
McJones, P. 1975. A Church-Rosser Property of Closed Applicative Languages. IBM Research Report RJ 1589. (IBM Research Laboratory, San Jose, California)
Minne, J. 1977. Programming in Backus' Red Languages. Data Flow Note 13 (University of California at Irvine, March 1977)
Moses, J. 1970. The Function of FUNCTION in LISP or Why the FUNARG Problem Should be Called the Environment Problem. MIT Report MAC-M-428. (MIT, Cambridge, Massachusetts)
Pozefsky, M. 1977. Programming in Reduction Languages. (Ph.D. Thesis, University of North Carolina at Chapel Hill)
Scott, D. 1971. The Lattice of Flow Diagrams. Symposium on Semantics of Algorithmic Languages. (Springer-Verlag, New York)
Weissman, C. 1967. LISP 1.5 Primer. (Dickenson, Belmont, California)
Wulfe, W. and Shaw, M. 1973. Global Variables Considered Harmful. Sigplan Notices, 13, 8, pp. 217–223
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koster, A. (1980). An algorithm for translating LISP programs into reduction language programs. In: Robinet, B. (eds) International Symposium on Programming. Programming 1980. Lecture Notes in Computer Science, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09981-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-09981-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09981-9
Online ISBN: 978-3-540-39233-0
eBook Packages: Springer Book Archive