Resugaring: Lifting Evaluation Sequences through Syntactic Sugar
Justin Pombrio, Shriram Krishnamurthi
ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014
Syntactic sugar is pervasive in language technology. It is used to shrink the size of a core language; to define domain-specific languages; and even to let programmers extend their language. Unfortunately, syntactic sugar is eliminated by transformation, so the resulting programs become unfamiliar to authors. Thus, it comes at a price: it obscures the relationship between the user’s source program and the program being evaluated.
We address this problem by showing how to compute reduction steps in terms of the surface syntax. Each step in the surface language emulates one or more steps in the core language. The computed steps hide the transformation, thus maintaining the abstraction provided by the surface language. We make these statements about emulation and abstraction precise, prove that they hold in our formalism, and verify part of the system in Coq. We have implemented this work and applied it to three very different languages.
For accompanying artifacts, please see http://cs.brown.edu/research/plt/dl/resugaring/v1/. We also have a newer, more advanced version of this result.
These papers may differ in formatting from the versions that appear in print. They are made available only to support the rapid dissemination of results; the printed versions, not these, should be considered definitive. The copyrights belong to their respective owners.