An alternative dynamic binding model: deep binding with cacheing

Authors:
Cyril N. Alberga
Affiliations:
T. J. Watson Research Center, IBM
Venue:
ACM SIGPLAN Lisp Pointers
Year:
1987

Citing 7
Cited 0

Closurize and concentrate

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Experience with an uncommon Lisp

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
A model and stack implementation of multiple environments

Communications of the ACM
Implementation of Interlisp on the VAX

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Constant time interpretation for shallow-bound variables in the presence of mixed special/local declarations

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
LISP/370: a short technical description of the implementation

ACM SIGSAM Bulletin
The scheme environment: dynamic variables

ACM SIGPLAN Lisp Pointers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two most common dynamic binding models used in Lisp systems are shallow and deep binding. For a succinct summery of these see Padget and Fitch [1985], which includes a proposed third model. It is often claimed that shallow binding are unsuited to systems which allow context switching. We wish to describe an alternative binding model, deep binding with cacheing, which provides the efficiency of shallow binding in "ordinary" call/return control, while exhibiting the ease of context switching of deep binding. This binding model was implemented in the Lisp system built at the IBM Research Center, later elaborated into LISP/VM. In this article the term LISP/VM will be used to encompass both that program and all of its progenitors developed at IBM Research.