Closurize and Concentrate

Julian A Padget, John P Fitch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationPOPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages255-265
Number of pages11
DOIs
Publication statusPublished - 1985
EventProceedings of POPL 85, New Orleans -
Duration: 1 Jan 1985 → …

Conference

ConferenceProceedings of POPL 85, New Orleans
Period1/01/85 → …

Fingerprint

Graph theory
Labeling
Semantics

Cite this

Padget, J. A., & Fitch, J. P. (1985). Closurize and Concentrate. In POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (pp. 255-265). New York: Association for Computing Machinery. https://doi.org/10.1145/318593.318656

Closurize and Concentrate. / Padget, Julian A; Fitch, John P.

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. New York : Association for Computing Machinery, 1985. p. 255-265.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Padget, JA & Fitch, JP 1985, Closurize and Concentrate. in POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. Association for Computing Machinery, New York, pp. 255-265, Proceedings of POPL 85, New Orleans, 1/01/85. https://doi.org/10.1145/318593.318656
Padget JA, Fitch JP. Closurize and Concentrate. In POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. New York: Association for Computing Machinery. 1985. p. 255-265 https://doi.org/10.1145/318593.318656
Padget, Julian A ; Fitch, John P. / Closurize and Concentrate. POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. New York : Association for Computing Machinery, 1985. pp. 255-265
@inproceedings{f58cf918744e44e58bbee9432cafc26a,
title = "Closurize and Concentrate",
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.",
author = "Padget, {Julian A} and Fitch, {John P}",
year = "1985",
doi = "10.1145/318593.318656",
language = "English",
pages = "255--265",
booktitle = "POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages",
publisher = "Association for Computing Machinery",
address = "USA United States",

}

TY - GEN

T1 - Closurize and Concentrate

AU - Padget, Julian A

AU - Fitch, John P

PY - 1985

Y1 - 1985

N2 - 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.

AB - 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.

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

U2 - 10.1145/318593.318656

DO - 10.1145/318593.318656

M3 - Conference contribution

SP - 255

EP - 265

BT - POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

PB - Association for Computing Machinery

CY - New York

ER -