Write a Blog >>
Thu 21 Jan 2016 17:20 - 17:45 at Grand Bay South - Track 2: Sessions and processes Chair(s): Matteo Maffei

Environmental bisimulations in probabilistic higher-order languages are studied. In contrast with applicative bisimulations, environmental bisimulations are known to be more robust and do not require sophisticated techniques such as Howe’s in the proofs of congruence.

As representative calculi, call-by-name and call-by-value $\lambda$-calculus, and a (call-by-value) $\lambda$-calculus extended with references (i.e., a store) are considered. In each case full abstraction results are derived for probabilistic environmental similarity and bisimilarity with respect to contextual preorder and contextual equivalence, respectively. Some possible enhancements of the (bi)simulations, as `up-to techniques’, are also presented.

Probabilities force a number of modifications to the definition of environmental bisimulations in non-probabilistic languages. Some of these modifications are specific to probabilities, others may be seen as general refinements of environmental bisimulations, applicable also to non-probabilistic languages. Several examples are presented, to illustrate the modifications and the differences.

Thu 21 Jan

POPL-2016-papers
16:30 - 17:45: Research Papers - Track 2: Sessions and processes at Grand Bay South
Chair(s): Matteo MaffeiSaarland University
POPL-2016-papers16:30 - 16:55
Talk
Dominic OrchardImperial College London, Nobuko YoshidaImperial College London, UK
Pre-print Media Attached
POPL-2016-papers16:55 - 17:20
Talk
Limin JiaCarnegie Mellon University, Hannah GommerstadtCarnegie Mellon University, Frank PfenningCarnegie Mellon University
Media Attached File Attached
POPL-2016-papers17:20 - 17:45
Talk
Davide SangiorgiUniversity of Bologna, Valeria VignudelliUniversity of Bologna/INRIA
Media Attached