Jacques at 10:53, 28 April 2023

2023-04-28T10:53:57Z

← Older revision		Revision as of 12:53, 28 April 2023
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:~~slides~~-delft-wg-2-11-partial-evaluation-algebra.pdf]]		[[Media:Slides-delft-wg-2-11-partial-evaluation-algebra.pdf]]

Jacques: 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..."

2023-04-28T10:52:18Z

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..."

New page

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:slides-delft-wg-2-11-partial-evaluation-algebra.pdf]]

WG211/M22Kammar - Revision history

Jacques at 10:53, 28 April 2023

Jacques: 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..."