Memory allocation and higher-order functions
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Control flow analysis in scheme
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Object-oriented programming in scheme
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Reification without evaluation
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Making asynchronous parallelism safe for the world
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
HARE: an optimizing portable compiler for Scheme
ACM SIGPLAN Notices
HOPL-II The second ACM SIGPLAN conference on History of programming languages
Proper tail recursion and space efficiency
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Expansion-passing style: beyond conventional macros
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
A Syntactic Theory of Message Passing
Journal of the ACM (JACM)
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
Communications of the ACM
Continuation-Based Multiprocessing Revisited
Higher-Order and Symbolic Computation
Optimizing Nested Loops Using Local CPS Conversion
Higher-Order and Symbolic Computation
Reflection and semantics in LISP
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Recursion is more efficient than iteration
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The implementation of procedurally reflective languages
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
S-1 Common Lisp implementation
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
An efficient environment allocation scheme in an interpreter for a lexically-scoped LISP
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Macaroni is better than spaghetti
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Language facilities for programmable backtracking
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
An optimizing compiler for lexically scoped LISP
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
ACM '77 Proceedings of the 1977 annual conference
Threaded interpretive systems and functional programming environments
ACM SIGPLAN Notices
Orbit: an optimizing compiler for scheme
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Higher-order control-flow analysis in retrospect: lessons learned, lessons abandoned
ACM SIGPLAN Notices - Best of PLDI 1979-1999
History of programming languages---II
The anatomy of a loop: a story of scope and control
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
The Trusted Execution Module: Commodity General-Purpose Trusted Computing
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Automatic generation of network protocol gateways
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
A new one-pass transformation into monadic normal form
CC'03 Proceedings of the 12th international conference on Compiler construction
From reduction-based to reduction-free normalization
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Automatic generation of network protocol gateways
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
A rational deconstruction of landin's SECD machine
IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
| Hi-index | 0.02 |
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.