|
 ABSTRACT
A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having to perform more evaluation steps than the usual method. Although the central idea can be found in earlier work this paper is of interest since it treats a rather well-known language and works out an algorithm which avoids full substitution. A partial correctness proof using Scott-Strachey semantics is sketched in a later section.
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
|
Curry, H.B. and Feys, R., Combinatory Logic, vol 1. North-Holland, 1958.
|
| |
2
|
Carl Hewitt , Peter Bishop , Richard Steiger , Irene Greif , Brian Smith , Todd Matson , Roger Hale, Behavioral semantics of nonrecursive control structures, Programming Symposium, Proceedings Colloque sur la Programmation, p.385-407, April 09-11, 1974
|
| |
3
|
Reynolds, J. R., Notes on a lattice-theoretic approach to the theory of computation, Lecture notes, Syracuse University, 1971.
|
| |
4
|
Scott, D. and Strachey, C., Toward a mathematical semantics for computer languages, Proc. of the Symposium on Computers and Automata, Polytechnic Institute of Brooklyn, and PRG-6 Oxford University Computing Laboratory, 1971.
|
| |
5
|
Stoy, J., The Scott-Strachey approach to the mathematical semantics of programming languages, Course notes at M.I.T. Project MAC, 1973.
|
| |
6
|
Vuillemin, J., Correct and optimal implementations of recursion in a simple programming language, Journal of Computer and System Sciences, vol. 9, No. 3, December 1974.
|
| |
7
|
Wadsworth, Christopher, Semantics and Pragmatics of the Lambda-calculus, PhD. thesis, Oxford, 1971.
|
CITED BY 97
|
|
|
|
|
|
|
|
Mike O'Donnell, Subtree replacement systems: A unifying theory for recursive equations, LISP, lucid and combinatory logic, Proceedings of the ninth annual ACM symposium on Theory of computing, p.295-305, May 04-04, 1977, Boulder, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Daniel P. Friedman , David S. Wise , Mitchell Wand, Recursive programming through table look-up, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.85-89, August 10-12, 1976, Yorktown Heights, New York, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. L. Page , M. G. Conant , D. H. Grit, If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.179-186, October 18-22, 1981, Portsmouth, New Hampshire, United States
|
|
|
|
|
|
R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peter Buneman , Rishiyur Nikhil , Robert Frankel, A practical functional programming system for databases, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.195-202, October 18-22, 1981, Portsmouth, New Hampshire, United States
|
|
|
|
|
|
Paul A. Bailes , Dan Johnston , Eric Salzman , Li Wang, Full functional programming in a declarative Ada dialect, Proceedings of the conference on TRI-Ada '92, p.350-358, November 16-20, 1992, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
Valentin F. Turchin , Robert M. Nirenberg , Dimitri V. Turchin, Experiments with a supercompiler, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.47-55, August 15-18, 1982, Pittsburgh, Pennsylvania, United States
|
|
|
Bharat Jayaraman , Frank S. K. Silbermann, Equations, sets, and reduction semantics for functional and logic programming, Proceedings of the 1986 ACM conference on LISP and functional programming, p.320-331, August 1986, Cambridge, Massachusetts, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Paul A. Bailes , Dan Johnson , Eric Salzman , Li Wang, DAda—an Ada preprocessor for functional programming, Proceedings of the conference on TRI-ADA '90, p.114-123, December 03-06, 1990, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
Philip Wadler, Applicative style programming, program transformation, and list operators, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.25-32, October 18-22, 1981, Portsmouth, New Hampshire, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
H. Harlyn Baker , Nina Bhatti , Donald Tanguay , Irwin Sobel , Dan Gelb , Michael E. Goss , W. Bruce Culbertson , Thomas Malzbender, Understanding performance in coliseum, an immersive videoconferencing system, ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP), v.1 n.2, p.190-210, May 2005
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Paul Hudak , John Hughes , Simon Peyton Jones , Philip Wadler, A history of Haskell: being lazy with class, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.12-1-12-55, June 09-10, 2007, San Diego, California
|
|
|
|
|
|
Joseph Y. Halpern , John H. Williams , Edward L. Wimmers , Timothy C. Winkler, Denotational semantics and rewrite rules for FP, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.108-120, January 14-16, 1985, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
D.3