<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Variable Bindings on PLSL</title>
    <link>https://plsl.acp.sdu.dk/tags/variable-bindings/</link>
    <description>Recent content in Variable Bindings on PLSL</description>
    <generator>Hugo</generator>
    <language>en-GB</language>
    <copyright>© ACP</copyright>
    <lastBuildDate>Wed, 22 Apr 2026 11:00:00 +0100</lastBuildDate>
    <atom:link href="https://plsl.acp.sdu.dk/tags/variable-bindings/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Abstract Syntax and Variable Binding</title>
      <link>https://plsl.acp.sdu.dk/posts/2026-04-30-abstract-syntax-and-variable-binding/</link>
      <pubDate>Wed, 22 Apr 2026 11:00:00 +0100</pubDate>
      <guid>https://plsl.acp.sdu.dk/posts/2026-04-30-abstract-syntax-and-variable-binding/</guid>
      <description>&lt;p&gt;In which we discuss Fiore, Plotkin, and Turi&amp;rsquo;s theory of abstract syntax.&#xA;&lt;a href=&#34;https://plsl.acp.sdu.dk/contact/&#34;&gt;Upon request&lt;/a&gt;, the session will be hosted as a hybrid&#xA;event.&lt;/p&gt;&#xA;&lt;h2 id=&#34;material&#34;&gt;Material&lt;/h2&gt;&#xA;&lt;p&gt;The material to be read &lt;strong&gt;before&lt;/strong&gt; the meeting is&#xA;&lt;a href=&#34;https://homepages.inf.ed.ac.uk/gdp/publications/Abstract_Syn.pdf&#34;&gt;Marcelo Fiore, Gordon Plotkin, and Daniele Turi. 1999. Abstract Syntax and&#xA;Variable Binding. In Proceedings of the 14th Annual IEEE Symposium on Logic in&#xA;Computer Science (LICS &amp;lsquo;99). IEEE Computer Society, USA,&#xA;193.&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&lt;/h2&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;We develop a theory of abstract syntax with variable&#xA;binding. To every binding signature we associate a cat-&#xA;egory of models consisting of variable sets endowed with&#xA;compatible algebra and substitution structures. The syntax&#xA;generated by the signature is the initial model. This gives a&#xA;notion of initial algebra semantics encompassing the tradi-&#xA;tional one; besides compositionality, it automatically veri-&#xA;fies the semantic substitution lemma.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
