Syntactic Abstraction in Scheme (1993) [14 citations — 2 self]
ftp://ftp.cs.indiana.edu/pub/techreports/TR355.ps.
ftp://ftp.cs.indiana.edu/pub/scheme/syntactic.ps.Z
http://www.cs.indiana.edu/~dyb/papers/syntactic.ps
http://www.cs.indiana.edu/l/www/ftp/techreports/TR
http://www.cs.indiana.edu/~dyb/pubs/LaSC-5-4-pp295
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Kent Dybvig and Robert Hieb and Carl Bruggeman},
title = {Syntactic Abstraction in Scheme},
booktitle = {Lisp and Symbolic Computation},
year = {1993},
pages = {295--326}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Naive program transformations can have surprising effects due to the interaction between introduced identifier references and previously existing identifier bindings, or between introduced bindings and previously existing references. These interactions can result in inadvertent binding, or capturing, of identifiers. A further complication is that transformed programs may have little resemblance to original programs, making correlation of source and object code difficult. This article describes an efficient macro system that prevents inadvertent capturing while maintaining the correlation between source and object code. The macro system allows the programmer to define program transformations using an unrestricted, general-purpose language. Previous approaches to the capturing problem have been inadequate, overly restrictive, or inefficient, and the problem of source-object correlation has been largely unaddressed. The macro system is based on a new algorithm for implementing syntactic transformations and a new representation for syntactic expressions.
