http://mw.hh.se/wg211/index.php?action=history&feed=atom&title=WG211%2FM10Shan 2026-04-05T19:30:43Z Revision history for this page on the wiki MediaWiki 1.43.5 http://mw.hh.se/wg211/index.php?title=WG211/M10Shan&diff=59&oldid=prev 2011-12-12T10:06:24Z

<p>1 revision</p> <p><b>New page</b></p><div>[[Category:WG211]]<br /> <br /> <br /> <br /> &lt;strong&gt;Computational Effects across Generated Binders, Part 2: Enforcing lexical scope&lt;/strong&gt; by Chung-chieh Shan (presenter) with Yukiyoshi Kameyama and Oleg Kiselyov<br /> <br /> If left unchecked, side effects in code generators often interact with&lt;br /&gt;generated binders badly to produce unexpectedly unbound variables, or&lt;br /&gt;worse, unexpectedly bound ones. The literature and our experience is&lt;br /&gt;rife with examples of these surprises, where variables with different&lt;br /&gt;scopes are mixed up. To prevent such surprises while still allowing&lt;br /&gt;arbitrary side effects to move open code past generated binders, we&lt;br /&gt;first define a notion of lexical scope for generated code with explicit&lt;br /&gt;contexts. To each generated binder, we attach a unique label that is&lt;br /&gt;checked against each use occurrence of the bound variable. We then&lt;br /&gt;introduce a static type system to assure that these checks will succeed.&lt;br /&gt;&lt;br /&gt;We embedded this type system in a Haskell library. We used this library&lt;br /&gt;to implement statically safe let-insertion across an arbitrary number of&lt;br /&gt;binders for the first time.</div>

Admin