Skip Navigation

The Computer Journal 1990 33(4):381; doi:10.1093/comjnl/33.4.381
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Merrett, T. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

Scoping is not Orthogonal to Completeness

T. H. Merrett *

School of Computer Science, (McGill University, McConnell Engineering Bld, 3480 University Street, Montreal, PQ H3A 2A7, Canada

The scoping of names in programming languages interacts adversely with first-class procedures if these carry their closures with them. In this paper it is suggested that, if scoping and privacy are regarded as separate concepts, it would provide a partial solution to the problem.

Received May 1988. revised November 1988.

* School of Computer Science (McGill University, McConnell Engineering Bld, 3480 University Street, Montreal, PQ H3A 2A7, Canada.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.