ACM Home Page
Please provide us with feedback. Feedback
Syntactic closures
Full text PdfPdf (828 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1988 ACM conference on LISP and functional programming table of contents
Snowbird, Utah, United States
Pages: 86 - 95  
Year of Publication: 1988
ISBN:0-89791-273-X
Authors
Alan Bawden  Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts
Jonathan Rees  Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 37,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/62678.62687
What is a DOI?

ABSTRACT

In this paper we describe syntactic closures. Syntactic closures address the scoping problems that arise when writing macros. We discuss some issues raised by introducing syntactic closures into the macro expansion interface, and we compare syntactic closures with other approaches. Included is a complete implementation.



CITED BY  12

Collaborative Colleagues:
Alan Bawden: colleagues
Jonathan Rees: colleagues