BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sergey Goncharov (University of Birmingham)
DTSTART:20241115T140000Z
DTEND:20241115T150000Z
DTSTAMP:20260513T120408Z
UID:TheoryCSBham/31
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/TheoryCSBham
 /31/">Introduction to Higher-Order Mathematical Operational Semantics</a>\
 nby Sergey Goncharov (University of Birmingham) as part of University of B
 irmingham theoretical computer science seminar\n\nLecture held in LG23\, C
 omputer Science.\n\nAbstract\nReasoning about program equivalence in highe
 r-order setting is one of the central topics in computer science\, with th
 e classical lambda-calculus as a prototypical example and with its countle
 ss flavors and extensions thereof\, all the way up to Haskell and OCaml. A
  recently emerged program of higher-order mathematical operational semanti
 cs aims to abstract and unify reasoning methods for such languages on the 
 basis of two parameters: the language syntax and its (small-step) operatio
 nal semantics. Thus\, higher-order mathematical operational semantics is a
  natural extension of the pioneering Turi and Plotkin's (first-order) math
 ematical operational semantics. Our program takes its origin from a joint 
 POPL-2023 publication with Stelios Tsampas\, Henning Urbat\, Stefan Milius
 \, and Lutz Schröder\, on which my present talk is largely based. Additio
 nally\, I will survey\, more succinctly\, subsequent advances of this prog
 ram\, outline challenges and perspectives for further work.\n
LOCATION:https://researchseminars.org/talk/TheoryCSBham/31/
END:VEVENT
END:VCALENDAR