Skip to Main content Skip to Navigation
Conference papers

On Applicative Similarity, Sequentiality, and Full Abstraction

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Vignudelli Valeria Connect in order to contact the contributor
Submitted on : Monday, November 16, 2015 - 3:36:49 PM
Last modification on : Thursday, January 20, 2022 - 4:13:45 PM
Long-term archiving on: : Friday, April 28, 2017 - 3:35:14 PM


Files produced by the author(s)




Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, Valeria Vignudelli. On Applicative Similarity, Sequentiality, and Full Abstraction. Correct System Design. Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Sep 2015, Oldenburg, Germany. ⟨10.1007/978-3-319-23506-6_7⟩. ⟨hal-01229398⟩



Les métriques sont temporairement indisponibles