We propose a new variant of typed syntactic macro systems named inverse macro, which improves the expressiveness of macro systems. The inverse macro system enables to implement operators with complex side-effects, such as lazy operators and delimited continuation operators, which are beyond the power of existing macro systems. We have implemented the inverse macro system as an extension to Scala 2.11. We also show the expressiveness of the inverse macro system by comparing two versions of shift/reset, bundled in Scala 2.11 and implemented with the inverse macro system.
Mon 26 Oct Times are displayed in time zone: Eastern Time (US & Canada) change
Mon 26 Oct
Times are displayed in time zone: Eastern Time (US & Canada) change
15:30 - 16:00 Talk | Safer SDN programming through Arbiter GPCE Michael LopezTexas A&M University, C. Jasson CaseyTexas A&M University and Flowgrammable.org, Gabriel Dos ReisTexas A&M University and Microsoft | ||
16:00 - 16:30 Talk | Contract-Based General-Purpose GPU Programming GPCE Alexey KolesnichenkoETH Zurich, Chris PoskittETH Zurich, Switzerland, Sebastian NanzETH Zurich, Bertrand MeyerETH Zurich, Innopolis University and Eiffel Software Link to publication DOI Pre-print Media Attached File Attached | ||
16:30 - 17:00 Talk | Inverse macro in Scala GPCE | ||
17:00 - 17:20 Talk | Towards Tool Support for Spreadsheet-based Domain-Specific Languages GPCE |