![]() |
![]() |
A Congruence Format for Nominal SOSAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dan Ghica. Structural Operational Semantics (SOS) is one of the most natural ways for providing programming languages with a formal semantics. Results on the meta-theory of SOS typically state that if the syntax that is employed in writing a semantic specification conforms to some syntactic template then certain properties are guaranteed to hold for the specified language. These syntactic templates are called rule formats. In this talk, we focus on Nominal SOS , a formalization of SOS with explicit syntax and primitives for the specification of languages with binders. We offer a rule format for Nominal SOS that guarantees that bisimilarity is a congruence. We show the applicability of the format to pi-calculus and (a modified) lambda-calculus, and we recover congruence for two classic equivalences, Sangiorgi’s open bisimilarity and Abramsky’s applicative bisimilarity. This talk is part of the Lab Lunch series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsReading Group in Combinatorics and Probability School of Metallurgy and Materials Colloquia Electromagnetic Communications and Sensing Research Seminar SeriesOther talksColloquium: TBA Seminar: TBA Geometry of alternating projections in metric spaces with bounded curvature Modelling uncertainty in image analysis. Seminar: TBA The science of the large scale heliosphere and the missions that made it possible |