First-class macros have types

ABSTRACT

In modern Scheme, a macro captures the lexical environment where it is defined. This creates an opportunity for extending Scheme so that macros are first-class values. The key to achieving this goal, while preserving the ability to compile programs into reasonable code, is the addition of a type system. Many interesting things can be done with first-class macros, including the construction of a useful module system in which modules are also first-class. Clams got legs! — B.C.

REFERENCES

• BR88: Alan Bawden , Jonathan Rees, Syntactic closures, Proceedings of the 1988 ACM conference on LISP and functional programming, p.86-95, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62687]
• Cli91: Willi~m Clinger. Hygienic macros through explicit renaming. LISP Pointers, 4(4):25-28, December 1991.
• CR90: Pavel Curtis , James Rauen, A module system for scheme, Proceedings of the 1990 ACM conference on LISP and functional programming, p.13-19, June 27-29, 1990, Nice, France [doi>10.1145/91556.91573]
• CR91: William Clinger , Jonathan Rees, Macros that work, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.155-162, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99607]
• DHB92: R. Kent Dybvig , Robert Hieb , Carl Bruggeman, Syntactic abstraction in Scheme, Lisp and Symbolic Computation, v.5 n.4, p.295-326, Dec. 1992 [doi>10.1007/BF01806308]
• KCR98: H. Abelson , R. K. Dybvig , C. T. Haynes , G. J. Rozas , N. I. Adams Iv , D. P. Friedman , E. Kohlbecker , G. L. Steele, Jr. , D. H. Bartley , R. Halstead , D. Oxley , G. J. Sussman , G. Brooks , C. Hanson , K. M. Pitman , M. Wand, Revised Report on the Algorithmic Language Scheme, Higher-Order and Symbolic Computation, v.11 n.1, p.7-105, August 1998 [doi>10.1023/A:1010051815785 ]
• KFFD86: Eugene Kohlbecker , Daniel P. Friedman , Matthias Felleisen , Bruce Duba, Hygienic macro expansion, Proceedings of the 1986 ACM conference on LISP and functional programming, p.151-161, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319859]
• Mac84: David MacQueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.198-207, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802036]
• Pit80: Kent M. Pitman, Special forms in Lisp, Proceedings of the 1980 ACM conference on LISP and functional programming, p.179-187, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802804]
• Ree89: Jonathan Rees. Modular macros. Master's thesis, MIT, May 1989. Dept. of Electrical Engineering and Computer Science.
• Ree93: Jonathan Rees. Another module system for Scheme. unpublished manuscript, January 1993.
• Ste90: Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990
• WD99: Oscar Waddell , R. Kent Dybvig, Extending the scope of syntactic abstraction, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.203-215, January 20-22, 1999, San Antonio, Texas, United States [doi>10.1145/292540.292559]

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

General Terms:
Design, Languages, Theory