Deep and shallow binding: The assignment operation

Authors:
Hanan Samet
Affiliations:
Computer Science Department, University of Maryland, College Park, MD 20742, U.S.A.
Venue:
Computer Languages
Year:
1979

Citing 10
Cited 1

New Programming Languages for Artificial Intelligence Research

ACM Computing Surveys (CSUR)
Shallow binding in Lisp 1.5

Communications of the ACM
A model and stack implementation of multiple environments

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
Anatomy of LISP

Anatomy of LISP
The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem

ACM SIGSAM Bulletin
A proposed solution to the FUNARG problem

ACM SIGSAM Bulletin
The SNOBOL 4 programming language

The SNOBOL 4 programming language
A retrospective view of the Hearsay-II architecture

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2

Binding strategies and scope rules are independent

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Programming languages which use dynamic identification for free variables (i.e., non-local references) are generally implemented with a deep or shallow binding variable access strategy. In this paper, variable access through the binding environment is assumed to be desirable. Given this assumption, it is demonstrated that the act of assigning values to variables may yield unexpected results for some of the binding strategies when functional arguments and results are used. A number of variations of deep and shallow binding strategies are examined along with the modifications necessary to implement the assignment operation in the expected manner.