Bawden, A. & Rees, J (1988) Syntactic closures. In Proceedings of the Lisp and Functional Programming, July 25–27, Snowbird, UT, USA. Pittsburgh: ACM, pp. 86–95.
Clinger, William D. (1991) Hygienic macros through explicit renaming. LISP Pointers 4 (4), 25–28.
Clinger, C. & Rees, J. (1991) Macros that work. In Proceedings of ACM Symposium on Principles of Programming Languages. New York, NY: ACM, pp. 155–162.
Dybvig, R. Kent, Friedman, Daniel P. & Haynes, Christopher T. (1988) Expansion-passing style: A general macro mechanism. LISP Symb. Comput. 1 (1), 53–75.
Dybvig, R. Kent, Hieb, R. & Bruggeman, C. (1993) Syntactic abstraction in Scheme. LISP Symb. Comput. 5 (4), 295–326.
Felleisen, M., Findler, R. B. & Flatt, M. (2009) Semantics Engineering with PLT Redex. Cambridge, MA: MIT Press.
Fisher, D. & Shivers, O (2008) Building language towers with Ziggurat. J. Funct. Program. 18 (5–6), 707–780.
Flatt, M. (2002) Compilable and composable macros, you want it when? In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002), Pittsburgh, PA, USA, October 4–6, pp. 72–83.
Gabbay, M. & Pitts, A. (1999) A new approach to abstract syntax involving binders. In the Proceedings of the 14th IEEE Symposium on Logic in Computer Science (LICS'99), Trento, Italy, pp. 341–363.
Gasbichler, M. (2006) Fully-Parameterized Higher-Order Modules with Hygienic Macros. PhD dissertation, Universität Tübingen, Tübingen, Germany.
Herman, D. (2010) A Theory of Typed Hygienic Macros. PhD dissertation, Northeastern University, Boston, Massachusetts.
Hilsdale, E. & Friedman, D. P. (2000) Writing macros in continuation-passing style. Proceedings of the Workshop on Scheme and Functional Programming, Montreal, September 17.
Kohlbecker, E. Eugene, Friedman, Daniel P, Felleisen, M. & Duba, B. (1986) Hygienic macro expansion. In Proceedings of the ACM Conference on Lisp and Functional Programming. New York, NY: ACM, pp. 151–181.
Kohlbecker, E. Eugene & Wand, M. (1987) Macro-by-example: Deriving syntactic transformations from their specifications. In Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Munich, Germany, January 2123, pp. 77–84.
Milner, R., Tofte, M. & Harper, R. (1990) The Definition of Standard ML. Cambridge, MA: MIT Press.
Pfenning, F. & Elliott, C. (1988) Higher-order abstract syntax. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation. New York, NY: ACM, pp. 199–208.
Pfenning, F. & Schürmann, C. (1999) System description: Twelf – a meta-logical framework for deductive systems. In Proceedings of the International Conference on Automated Deduction, Trento, Italy, pp. 202–206.
Sheard, T. & Peyton Jones, S. (2002) Template meta-programming for Haskell. In Proceedings of Haskell Workshop 2002, Pittsburgh, PA, USA, pp. 60–75.
Shinwell, Mark R., Pitts, A. M. & Gabbay, M. J. (2003) FreshML: Programming with binders made simple. In Proceedings of the 8th ACM International Conference on Functional Programming. New York, NY: ACM, pp. 263–274.
Sperber, M. (Ed.) (2009) Revised 6 report on the algorithmic language Scheme. J. Funct. Program. 19(supplement), 1–301.
Van Wyk, E., Bodin, D., Krishnan, L. & Gao, J. (2009) Silver: an extensible attribute grammar system. Sci. Comput. Program. 75 (1–2) doi: 10.1016/j.scico.2009.07.004
Waddell, O. & Dybvig, R. Kent (1999) Extending the scope of syntactic abstraction. In Proceedings of ACM Symposium on the Principles of Programming Languages. New York, NY: ACM, pp. 203–213.