[1]   Kevin Atkinson. ABI Compatibility Through a Customizable Language. PhD thesis, University of Utah, 2011.

[2]   Kevin Atkinson and Matthew Flatt. Adapting Scheme-like macros to a C-like language. In Proc. Workshop on Scheme and Functional Programming, Portland, Oregon, 2011.

[3]   Kevin Atkinson, Matthew Flatt, and Gary Lindstrom. ABI compatibility through a customizable language. In Proc. Generative Programming and Component Engineering (GPCE), pages 147–156, Eindhoven, The Netherlands, 2010.

[4]   Eli Barzilay, Ryan Culpepper, and Matthew Flatt. Keeping it clean with syntax parameters. In Proc. Workshop on Scheme and Functional Programming, Portland, OR, 2011.

[5]   R. Kent Dybvig. Syntactic abstraction: the syntax-case expander. In Andy Oram and Greg Wilson, editors, Beautiful Code: Leading Programmers Explain How They Think, chapter 25, pages 407–428. O’Reilly and Associates, June 2007.

[6]   R. Kent Dybvig, Robert Hieb, and Carl Bruggeman. Syntactic abstraction in Scheme. Lisp and Symbolic Computation, 5(4):295–326, 1992.

[7]   Eric Eide and John Regehr. Volatiles are miscompiled, and what to do about it. In Proc. Intl. Conf. on Embedded Software (EMSOFT), 2008.

[8]   Matthew Flatt and PLT. Reference: Racket. Technical Report PLT-TR-2010-1, PLT Inc., 2010.

[9]   Robert W. Floyd. Syntactic analysis and operator precedence. J. ACM, 10(3):316–333, 1963.

[10]   Bryan Ford. Packrat parsing: A practical linear-time algorithm with backtracking. Master’s thesis, Massachusetts Institute of Technology, 2002.

[11]   Bryan Ford. Packrat parsing: Simple, powerful, lazy, linear time. In Proc. Intl. Conf. Functional Programming (ICFP), pages 36–47, Pittsburgh, PA, 2002.

[12]   Bryan Ford. Parsing expression grammars: a recognition-based syntactic foundation. In Proc. POPL, pages 111–122, Venice, Italy, 2004.

[13]   Robert Grimm. Better extensibility through modular syntax. In Proc. PLDI, pages 38–51, Ottawa, Ontario, 2006.

Converted From LaTeX using TeX4ht. PDF Version