Apparaît dans la 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.