On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep
WG211/M22Kammar: Difference between revisions
From WG 2.11
Jump to navigationJump to search
Created page with "Modern partial evaluation takes advantage of semantic invariants and properties to partially evaluate stuck open code fragments. In this talk, I will argue that the motivation..." |
No edit summary |
||
| Line 1: | Line 1: | ||
Modern partial evaluation takes advantage of semantic invariants and properties to partially evaluate stuck open code fragments. In this talk, I will argue that the motivation for modern algebra is similar: studying actions on an unknown state on their own. We will implement a simple partial evaluator for a stateful, straight-line programming language, and draw connections to its associated monoid action. As a consequence, the free extension of this associated action is the data-structure needed for partially evaluating programs using semantic equivalences. Time permitting, I will outline our research programme in utilising modern algebra techniques to the development of modular modern partial evaluation libraries. | Modern partial evaluation takes advantage of semantic invariants and properties to partially evaluate stuck open code fragments. In this talk, I will argue that the motivation for modern algebra is similar: studying actions on an unknown state on their own. We will implement a simple partial evaluator for a stateful, straight-line programming language, and draw connections to its associated monoid action. As a consequence, the free extension of this associated action is the data-structure needed for partially evaluating programs using semantic equivalences. Time permitting, I will outline our research programme in utilising modern algebra techniques to the development of modular modern partial evaluation libraries. | ||
[[Media: | [[Media:Slides-delft-wg-2-11-partial-evaluation-algebra.pdf]] | ||
Latest revision as of 12:53, 28 April 2023
Modern partial evaluation takes advantage of semantic invariants and properties to partially evaluate stuck open code fragments. In this talk, I will argue that the motivation for modern algebra is similar: studying actions on an unknown state on their own. We will implement a simple partial evaluator for a stateful, straight-line programming language, and draw connections to its associated monoid action. As a consequence, the free extension of this associated action is the data-structure needed for partially evaluating programs using semantic equivalences. Time permitting, I will outline our research programme in utilising modern algebra techniques to the development of modular modern partial evaluation libraries.
