Sam Tobin-Hochstadt on Composable and Compilable Macros

Composable and Compilable Macros introduces the Racket module system, which addresses the following problem: When you have macros that run programs at compile-time, how does this interact with separate compilation and ahead-of-time compilation. The paper introduces "phases", which enable Racket to behave the same regardless of when and how you compile your program. It also introduces the idea of writing different modules in different languages, which is now used for systems like Typed Racket.


Slides Audio Meetup


Sam Tobin-Hochstadt (@samth) is an Assistant Professor in the School of Informatics and Computing at Indiana University. He has worked on dynamic languages, type systems, module systems, and metaprogramming, including creating the Typed Racket system and popularizing the phrase “scripts to programs.” He is a member of the ECMA TC39 working group responsible for standardizing JavaScript, where he co-designed the module system for ES6, the next version of JavaScript. He received his PhD in 2010 from Northeastern University under Matthias Felleisen.

TwoSigma The New York Chapter would like to thank our platinum sponsor TwoSigma for helping to make this meetup possible.

Additional resources

  • Syntactic Abstraction in Scheme, Dybvig Hieb & Bruggeman, Lisp and Symbolic Computation 1993
  • Macros that Work Together, Flatt, Findler, Culpepper, & Darais, JFP 2012
  • Submodules in Racket, Flatt GPCE 2013
  • Implicit phasing for R6RS libraries, Ghuloum & Dybvig, ICFP 2007
  • Extending the scope of syntactic abstraction, Waddell & Dybvig, POPL 1999