LAMBDA: The Ultimate DeclarativeNovember 1976
- Author:
- Guy L Steele
Skip Abstract Section
Abstract
In this paper, a sequel to ``Lambda: The Ultimate Imperative,'''' a new view of LAMBDA as a {\it renaming} operator is presented and contrasted with the usual functional view taken by LISP. This view, combined with the view of function invocation as a kind of generalized GO TO, leads to several new insights into the nature of the LISP evaluation mechanism and the symmetry between form and function, evaluation and application, and control and environment.
Cited By
Downen P, Maurer L, Ariola Z and Peyton Jones S (2016). Sequent calculus as a compiler intermediate language, ACM SIGPLAN Notices, 51:9, (74-88), Online publication date: 5-Dec-2016.- Downen P, Maurer L, Ariola Z and Peyton Jones S Sequent calculus as a compiler intermediate language Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, (74-88)
- Herzeel C and Costanza P Dynamic parallelization of recursive code Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (377-396)
- Herzeel C and Costanza P (2010). Dynamic parallelization of recursive code, ACM SIGPLAN Notices, 45:10, (377-396), Online publication date: 17-Oct-2010.
- Bromberg Y, Réveillère L, Lawall J and Muller G Automatic generation of network protocol gateways Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware, (1-20)
- Bromberg Y, Réveillère L, Lawall J and Muller G Automatic generation of network protocol gateways Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware, (21-41)
- Danvy O From reduction-based to reduction-free normalization Proceedings of the 6th international conference on Advanced functional programming, (66-164)
- Shivers O The anatomy of a loop Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, (2-14)
- Shivers O (2019). The anatomy of a loop, ACM SIGPLAN Notices, 40:9, (2-14), Online publication date: 12-Sep-2005.
- Kranz D, Kelsey R, Rees J, Hudak P, Philbin J and Adams N (2004). Orbit, ACM SIGPLAN Notices, 39:4, (175-191), Online publication date: 1-Apr-2004.
- Shivers O (2004). Higher-order control-flow analysis in retrospect, ACM SIGPLAN Notices, 39:4, (257-269), Online publication date: 1-Apr-2004.
- Chambers C and Ungar D (2004). A retrospective on, ACM SIGPLAN Notices, 39:4, (295-312), Online publication date: 1-Apr-2004.
- Danvy O A rational deconstruction of landin's SECD machine Proceedings of the 16th international conference on Implementation and Application of Functional Languages, (52-71)
- Danvy O A new one-pass transformation into monadic normal form Proceedings of the 12th international conference on Compiler construction, (77-89)
- Reppy J (2019). Optimizing Nested Loops Using Local CPS Conversion, Higher-Order and Symbolic Computation, 15:2-3, (161-180), Online publication date: 1-Sep-2002.
- Wand M (1999). Continuation-Based Multiprocessing Revisited, Higher-Order and Symbolic Computation, 12:3, (283-283), Online publication date: 1-Oct-1999.
- Clinger W Proper tail recursion and space efficiency Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (174-185)
- Clinger W (1998). Proper tail recursion and space efficiency, ACM SIGPLAN Notices, 33:5, (174-185), Online publication date: 1-May-1998.
- Steele G and Gabriel R The evolution of Lisp History of programming languages---II, (233-330)
- Teodosiu D (1991). HARE, ACM SIGPLAN Notices, 26:1, (109-120), Online publication date: 1-Jan-1991.
- Chambers C, Ungar D and Lee E An efficient implementation of SELF a dynamically-typed object-oriented language based on prototypes Conference proceedings on Object-oriented programming systems, languages and applications, (49-70)
- Chambers C, Ungar D and Lee E (1989). An efficient implementation of SELF a dynamically-typed object-oriented language based on prototypes, ACM SIGPLAN Notices, 24:10, (49-70), Online publication date: 1-Oct-1989.
- Steele G Making asynchronous parallelism safe for the world Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (218-231)
- Shivers O Control flow analysis in scheme Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, (164-174)
- Shivers O (1988). Control flow analysis in scheme, ACM SIGPLAN Notices, 23:7, (164-174), Online publication date: 1-Jul-1988.
- Bawden A Reification without evaluation Proceedings of the 1988 ACM conference on LISP and functional programming, (342-349)
- Adams N and Rees J Object-oriented programming in scheme Proceedings of the 1988 ACM conference on LISP and functional programming, (277-288)
- Danvy O Memory allocation and higher-order functions Papers of the Symposium on Interpreters and interpretive techniques, (241-252)
- Danvy O (2019). Memory allocation and higher-order functions, ACM SIGPLAN Notices, 22:7, (241-252), Online publication date: 1-Jul-1987.
- Dybvig R, Friedman D and Haynes C Expansion-passing style: beyond conventional macros Proceedings of the 1986 ACM conference on LISP and functional programming, (143-150)
- de Jong P (1986). Compilation into actors, ACM SIGPLAN Notices, 21:10, (68-77), Online publication date: 1-Oct-1986.
- de Jong P Compilation into actors Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming, (68-77)
- Glass H (1985). Threaded interpretive systems and functional programming environments, ACM SIGPLAN Notices, 20:4, (24-32), Online publication date: 1-Apr-1985.
- Smith B Reflection and semantics in LISP Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (23-35)
- Saint-James E Recursion is more efficient than iteration Proceedings of the 1984 ACM Symposium on LISP and functional programming, (228-234)
- Rivières J and Smith B The implementation of procedurally reflective languages Proceedings of the 1984 ACM Symposium on LISP and functional programming, (331-347)
- Brooks R, Gabriel R and Steele G S-1 Common Lisp implementation Proceedings of the 1982 ACM symposium on LISP and functional programming, (108-113)
- Brooks R, Gabriel R and Steele G An optimizing compiler for lexically scoped LISP Proceedings of the 1982 SIGPLAN symposium on Compiler construction, (261-275)
- Brooks R, Gabriel R and Steele G (2019). An optimizing compiler for lexically scoped LISP, ACM SIGPLAN Notices, 17:6, (261-275), Online publication date: 1-Jun-1982.
- Rees J and Adams IV N T: a dialect of Lisp or LAMBDA Proceedings of the 1982 ACM symposium on LISP and functional programming, (114-122)
- Wand M Continuation-based multiprocessing Proceedings of the 1980 ACM conference on LISP and functional programming, (19-28)
- McDermott D An efficient environment allocation scheme in an interpreter for a lexically-scoped LISP Proceedings of the 1980 ACM conference on LISP and functional programming, (154-162)
- Winograd T (1979). Beyond programming languages, Communications of the ACM, 22:7, (391-401), Online publication date: 1-Jul-1979.
- Steele G Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA Proceedings of the 1977 annual conference, (153-162)
- Steele G Macaroni is better than spaghetti Proceedings of the 1977 symposium on Artificial intelligence and programming languages, (60-66)
- Griswold R and Hanson D Language facilities for programmable backtracking Proceedings of the 1977 symposium on Artificial intelligence and programming languages, (94-99)
- Steele G (2019). Macaroni is better than spaghetti, ACM SIGPLAN Notices, 12:8, (60-66), Online publication date: 1-Aug-1977.
- Griswold R and Hanson D (1977). Language facilities for programmable backtracking, ACM SIGPLAN Notices, 12:8, (94-99), Online publication date: 1-Aug-1977.
- Steele G (2019). Macaroni is better than spaghetti, ACM SIGART Bulletin:64, (60-66), Online publication date: 1-Aug-1977.
- Griswold R and Hanson D (2019). Language facilities for programmable backtracking, ACM SIGART Bulletin:64, (94-99), Online publication date: 1-Aug-1977.
