Applicative bisimulation for higher-order probabilistic languages | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Applicative bisimulation for higher-order probabilistic languages

By Raphaëlle Crubillé

Appears in collection : French Spring School in Theoretical Computer Science / École de Printemps d'Informatique Théorique

We will recall the foundations of Abramsky's applicative bisimulation for the pure lambda-calculus, and present its generalisations to probabilistic lambda-calculi (for both discrete and continuous probabilities). We will conclude by some perspectives on how to make applicative bisimulation quantitative, leading to ideas of distances between programs.

Information about the video

Date of recording 11/05/2026
Date of publication 26/05/2026
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.20480503
Cite this video Crubillé, Raphaëlle (11/05/2026). Applicative bisimulation for higher-order probabilistic languages. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20480503
URL https://dx.doi.org/10.24350/CIRM.V.20480503

Domain(s)

MSC codes

Document(s)

https://www.cirm-math.fr/RepOrga/3489/Slides/epit_cours_1_crubille.pdf

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2026

Give feedback