Combinators for impure yet hygienic code generation

Yukiyoshi Kameyama, Oleg Kiselyov, Chung Chieh Shan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Code generation is the leading approach to making high-performance software reusable. Effects are indispensable in code generators, whether to report failures or to insert let-statements and if- guards. Extensive painful experience shows that unrestricted effects interact with generated binders in undesirable ways to produce unexpectedly unbound variables, or worse, unexpectedly bound ones. These subtleties hinder domain experts in using and extending the generator. A pressing problem is thus to express the desired effects while regulating them so that the generated code is correct, or at least correctly scoped, by construction. We present a code-combinator framework that lets us express arbitrary monadic effects, including mutable references and delimited control, that move open code across generated binders. The static types of our generator expressions not only ensure that a well-typed generator produces well-typed and well-scoped code. They also express the lexical scopes of generated binders and prevent mixing up variables with different scopes. For the first time ever we demonstrate statically safe and well-scoped loop exchange and constant factoring from arbitrarily nested loops. Our framework is implemented as a Haskell library that embeds an extensible typed higher-order domain-specific language. It may be regarded as 'staged Haskell.' To become practical, the library relies on higher-order abstract syntax and polymorphism over generated type environments, and is written in the mature language. Categories and Subject Descriptors D.3.1 [Programming Languages]: Formal Definitions and Theory; D.3.3 [Programming Languages]: Language Constructs and Features-Control structures; polymorphism; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs-Type structure.

Original languageEnglish
Title of host publicationPEPM 2014 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2014
PublisherAssociation for Computing Machinery
Pages3-14
Number of pages12
ISBN (Print)9781450326193
DOIs
Publication statusPublished - 2014 Jan 1
EventACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2014 - Co-located with POPL 2014 - San Diego, CA, United States
Duration: 2014 Jan 202014 Jan 21

Publication series

NamePEPM 2014 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2014

Other

OtherACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2014 - Co-located with POPL 2014
CountryUnited States
CitySan Diego, CA
Period14/1/2014/1/21

Keywords

  • Binders
  • CPS
  • Higher-order abstract syntax
  • Lexical scope
  • Multi-stage programming
  • Mutable state and control effects

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition
  • Software

Fingerprint Dive into the research topics of 'Combinators for impure yet hygienic code generation'. Together they form a unique fingerprint.

  • Cite this

    Kameyama, Y., Kiselyov, O., & Shan, C. C. (2014). Combinators for impure yet hygienic code generation. In PEPM 2014 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2014 (pp. 3-14). (PEPM 2014 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2014). Association for Computing Machinery. https://doi.org/10.1145/2543728.2543740