<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM26Kovacs</id>
	<title>WG211/M26Kovacs - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM26Kovacs"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M26Kovacs&amp;action=history"/>
	<updated>2026-10-26T17:50:27Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M26Kovacs&amp;diff=2906&amp;oldid=prev</id>
		<title>Jeremy-y: Created page with &quot;&#039;&#039;&#039;Thinning-stable metaprogramming&#039;&#039;&#039;  &#039;&#039;András Kovács&#039;&#039;   In this talk I give an overview of various notions of stability in metaprogramming and propose stability under thinning as a setup which shows some promise and which has not yet been explored. When we have &quot;f : Code a -&gt; Code b&quot; in some staged language, we expect &quot;f&quot; to work on object expressions in arbitrary scopes. So, semantically we&#039;d like to have &quot;∀ Γ. Code Γ a → Code Γ b&quot;. However, functions of suc...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M26Kovacs&amp;diff=2906&amp;oldid=prev"/>
		<updated>2026-10-07T08:07:44Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Thinning-stable metaprogramming&amp;#039;&amp;#039;&amp;#039;  &amp;#039;&amp;#039;András Kovács&amp;#039;&amp;#039;   In this talk I give an overview of various notions of stability in metaprogramming and propose stability under thinning as a setup which shows some promise and which has not yet been explored. When we have &amp;quot;f : Code a -&amp;gt; Code b&amp;quot; in some staged language, we expect &amp;quot;f&amp;quot; to work on object expressions in arbitrary scopes. So, semantically we&amp;#039;d like to have &amp;quot;∀ Γ. Code Γ a → Code Γ b&amp;quot;. However, functions of suc...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Thinning-stable metaprogramming&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;András Kovács&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In this talk I give an overview of various notions of stability in metaprogramming and propose stability under thinning as a setup which shows some promise and which has not yet been explored. When we have &amp;quot;f : Code a -&amp;gt; Code b&amp;quot; in some staged language, we expect &amp;quot;f&amp;quot; to work on object expressions in arbitrary scopes. So, semantically we&amp;#039;d like to have &amp;quot;∀ Γ. Code Γ a → Code Γ b&amp;quot;. However, functions of such type can inspect Γ in arbitrary unhygienic ways. So we&amp;#039;d like to restrict ourselves to metaprograms that are stable under certain morphisms between object-level scopes. Previous works have explored stability under a) substitution b) variable renaming c) injective variable renaming, in various logical frameworks and nominal and staged calculi. I investigate stability under thinning (also known as order-preserving embedding).&lt;/div&gt;</summary>
		<author><name>Jeremy-y</name></author>
	</entry>
</feed>