Recovery of reentrant list structures in SLIP
Communications of the ACM
Structure of a LISP system using two-level storage
Communications of the ACM
The next 700 programming languages
Communications of the ACM
LISP 1.5 Programmer's Manual
Transformations and reduction strategies for typed lambda expressions
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
Communications of the ACM
A model and stack implementation of multiple environments
Communications of the ACM
A scheme for implementing functional values on a stack machine
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Compiling functional languages for von Neumann machines
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
Proceedings of ACM conference on Proving assertions about programs
The language LISP does not exist?
ACM SIGPLAN Notices
A preliminary survey of artificial intelligence machines
ACM SIGART Bulletin
A proposed solution to the FUNARG problem
ACM SIGSAM Bulletin
Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs
IEEE Transactions on Computers
A Model for Control Structures for Artificial Intelligence Programming Languages
IEEE Transactions on Computers
Multiple evaluators in an extensible programming system
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Self-Sustaining Systems
Celebrating the 50th Anniversary of Lisp
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A model for control structures for artificial intelligence programming languages
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Closure joinpoints: block joinpoints without surprises
Proceedings of the tenth international conference on Aspect-oriented software development
Binding strategies and scope rules are independent
Computer Languages
Deep and shallow binding: The assignment operation
Computer Languages
Compiling lambda-expressions using continuations and factorizations
Computer Languages
Hi-index | 0.05 |
A problem common to many powerful programming languages arises when one has to determine what values to assign to free variables in functions. Different implementational approaches which attempt to solve the problem are considered. The discussion concentrates on LISP implementations and points out why most current LISP systems are not as general as the original LISP 1.5 system. Readers not familiar with LISP should be able to read this paper without difficulty since we have tried to couch the argument in ALGOL-like terms as much as possible.