http://mw.hh.se/wg211/index.php?action=history&feed=atom&title=WG211%2FM10KiselyovWG211/M10Kiselyov - Revision history2026-04-05T19:32:32ZRevision history for this page on the wikiMediaWiki 1.43.5http://mw.hh.se/wg211/index.php?title=WG211/M10Kiselyov&diff=45&oldid=prevAdmin: 1 revision2011-12-12T10:06:23Z<p>1 revision</p>
<p><b>New page</b></p><div>[[Category:WG211]]<br />
<br />
<br />
<br />
'''Computational Effects across Generated Binders, Part 1: Problems and solutions''' by Oleg Kiselyov (presenter) with Yukiyoshi Kameyama and Chung-chieh Shan<br />
<br />
Code generation is the leading approach to making high-performance<br />software reusable. Using a set of realistic examples, we demonstrate<br />that side effects are indispensable in composable code generators,<br />especially side effects that move open code past generated binders. We<br />challenge the audience to implement these examples in their favorite<br />code-generation framework.<br /><br />We implemented the examples ourselves using a prototype library of<br />code-generating combinators in Haskell. This library statically assures<br />not only that all generated code is well-formed and well-typed but also<br />that all generated variables are bound lexically as expected. Such<br />assurances are crucial for code generators to be written by domain<br />experts rather than compiler writers, because the most profitable<br />optimizations are domain-specific ones.</div>Admin