We study how applicative bisimilarity behaves when instantiated on a call-by-value probabilistic λ-calculus, endowed with Plotkin’s parallel disjunction operator. We prove that congruence and coincidence with the corresponding context relation hold for both bisimilarity and similarity, the latter known to be impossible in sequential languages.
Crubillé, R., Dal Lago, U., Sangiorgi, D., Vignudelli, V. (2015). On Applicative Similarity, Sequentiality, and Full Abstraction. Berlin : Meyer, Roland; Platzer, André; Wehrheim, Heike [10.1007/978-3-319-23506-6_7].
On Applicative Similarity, Sequentiality, and Full Abstraction
CRUBILLÉ, RAPHAËLLE;DAL LAGO, UGO;SANGIORGI, DAVIDE;VIGNUDELLI, VALERIA
2015
Abstract
We study how applicative bisimilarity behaves when instantiated on a call-by-value probabilistic λ-calculus, endowed with Plotkin’s parallel disjunction operator. We prove that congruence and coincidence with the corresponding context relation hold for both bisimilarity and similarity, the latter known to be impossible in sequential languages.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
