Composable and compilable macros:: you want it when?

ABSTRACT

Many macro systems, especially for Lisp and Scheme, allow macro transformers to perform general computation. Moreover, the language for implementing compile-time macro transformers is usually the same as the language for implementing run-time functions. As a side effect of this sharing, implementations tend to allow the mingling of compile-time values and run-time values, as well as values from separate compilations. Such mingling breaks programming tools that must parse code without executing it. Macro implementors avoid harmful mingling by obeying certain macro-definition protocols and by inserting phase-distinguishing annotations into the code. However, the annotations are fragile, the protocols are not enforced, and programmers can only reason about the result in terms of the compiler's implementation. MzScheme---the language of the PLT Scheme tool suite---addresses the problem through a macro system that separates compilation without sacrificing the expressiveness of macros.

REFERENCES

• 1: Jason Baker , Wilson C. Hsieh, Maya: multiple-dispatch syntax extension in Java, Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, June 17-19, 2002, Berlin, Germany
• 2: 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]
• 3: H Bromley, Lisp lore: a guide to programming the Lisp machine, Kluwer Academic Publishers, Norwell, MA, 1986
• 4: 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]
• 5: 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]
• 6: Rowan Davies , Frank Pfenning, A modal analysis of staged computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.258-270, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237788]
• 7: R. K. Dybvig. Chez Scheme User's Guide. Cadence Research Systems, 1998.
• 8: 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]
• 9: Matthew Flatt , Matthias Felleisen, Units: cool modules for HOT languages, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, p.236-248, June 17-19, 1998, Montreal, Quebec, Canada
• 10: Daniel P. Friedman , Christopher T. Haynes , Mitchell Wand, Essentials of programming languages (2nd ed.), Massachusetts Institute of Technology, Cambridge, MA, 2001
• 11: Steven E. Ganz , Amr Sabry , Walid Taha, Macros as multi-stage computations: type-safe, generative, binding macros in MacroML, Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, September 03-05, 2001, Florence, Italy
• 12: T. P. Hart and T. G. Evans. Notes on implementing lisp for the m-460 computer. In E. C. Berkeley and D. G. Bowbrow, editors, The Programming language LISP: Its Operation and Applications, pages 191--203. MIT Press, 1964.
• 13: R. Kelsey. SRFI 19: Defining record types, 1999. http://srfi.schemers.org/srfi-9/.
• 14: N. I. Adams, IV , D. H. Bartley , G. Brooks , R. K. Dybvig , D. P. Friedman , R. Halstead , C. Hanson , C. T. Haynes , E. Kohlbecker , D. Oxley , K. M. Pitman , G. J. Rozas , G. L. Steele, Jr. , G. J. Sussman , M. Wand , H. Abelson, Revised5 report on the algorithmic language scheme, ACM SIGPLAN Notices, v.33 n.9, p.26-76, Sept. 1, 1998 [doi>10.1145/290229.290234]
• 15: 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]
• 16: Eugenio Moggi , Walid Taha , Zine-El-Abidine Benaissa , Tim Sheard, An Idealized MetaML: Simpler, and More Expressive, Proceedings of the 8th European Symposium on Programming Languages and Systems, p.193-207, March 22-28, 1999
• 17: D. A. Moon. MACLISP Reference Manual. MIT Press, 1974.
• 18: Massimiliano Poletto , Wilson C. Hsieh , Dawson R. Engler , M. Frans Kaashoek, C and tcc: a language and compiler for dynamic code generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.2, p.324-369, March 1999 [doi>10.1145/316686.316697]
• 19: C. Queinnec. Macroexpansion reflective tower. In Proc. Reflections Conference, pages 93--194, Apr. 1996.
• 20: J. Rees. Another module system for Scheme, 1994. Scheme48 documentation.
• 21: M. Serrano. Bigloo: A "practical Scheme compiler", 2002.
• 22: A. Shalit. The Dylan Reference Manual. Addison-Wesley, 1996.
• 23: Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990
• 24: G. L. Steele, Jr. and G. J. Sussman. The revised report on SCHEME: A dialect of LISP. Technical Report 452, MIT, Jan. 1978.
• 25: 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]
• 26: Daniel Weise , Roger Crew, Programmable syntax macros, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.156-165, June 21-25, 1993, Albuquerque, New Mexico, United States
• 27: A. K. Wright. Pattern Matching for Scheme, Mar. 1996.

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
        D.2.12 Interoperability
  D.3 PROGRAMMING LANGUAGES
      D.3.4 Processors
          Subjects: Preprocessors; Parsing

General Terms:
Design, Languages

Keywords:
language tower, macros, modules