BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Maribel Fernandez (Kings College London)
DTSTART:20230202T190000Z
DTEND:20230202T200000Z
DTSTAMP:20260423T021112Z
UID:OLS/111
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/111/">No
 minal Techniques for the Specification of Languages with Binders</a>\nby M
 aribel Fernandez (Kings College London) as part of Online logic seminar\n\
 n\nAbstract\nThe nominal approach to the specification of languages with b
 inding operators\, introduced by Gabbay and Pitts\, has its roots in nomin
 al set theory. Nominal logic is a theory of first-order logic that axiomat
 izes the notions of fresh name\, name swapping and abstraction from nomina
 l sets\, making it an ideal tool for the specification of the semantics of
  programming languages. In this talk\, we will start by recalling the main
  concepts of nominal logic\, and then we will show how to apply these idea
 s to specify calculi with binders. More precisely\, we will introduce nomi
 nal syntax (including the notions of fresh atoms and alpha-equivalence)\, 
 present matching and unification algorithms that take into account the alp
 ha-equivalence relation\, define nominal rewriting (a generalisation of fi
 rst-order rewriting that provides in-built support for alpha-equivalence f
 ollowing the nominal approach) and give examples of application.\n
LOCATION:https://researchseminars.org/talk/OLS/111/
END:VEVENT
END:VCALENDAR