Research

Closurize and Concentrate


Reference:

Padget, J. A. and Fitch, J. P., 1985. Closurize and Concentrate. In: POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. New York: ACM, pp. 255-265.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/10.1145/318593.318656

Abstract

This paper considers current solutions to the problem of representing multiple environments, and uses the results to develop a new model. The motivation is partly a consequence of the renewed interest in the more sophisticated forms of access and control [Sussman & Steele 1978], [Smith 1983]. [Friedman et al. 1984], and partly because the problem identified by Moses [1970] has not, as yet, been satisfactorily resolved. The new model is derived from a consideration of the semantics of identifier binding interrogation. The implementation itself rests on the existence of an environment labeling function which solves a variant of a well known graph theory problem called nearest common ancestor. We describe a suitable implementation of such a function. The new scheme has been implemented in two different LISP systems (Cambridge LISP and Portable Standard LISP), and a third (LISP/VM) is under consideration. In addition, pure deep binding and full shallow binding have both been implemented on top the same base system (Cambridge LISP). Thus it is possible to collect comparisons of the relative efficiencies running simple (stack behavior) programs and complex (multiple context) programs. Some timing results for various tests are given in the final section.

Details

Item Type Book Sections
CreatorsPadget, J. A.and Fitch, J. P.
DOI10.1145/318593.318656
DepartmentsFaculty of Science > Computer Science
StatusPublished
ID Code16420

Export

Actions (login required)

View Item