On Applicative Similarity, Sequentiality, and Full Abstraction

Raphaëlle Crubillé 1 Ugo Dal Lago 2, 3 Davide Sangiorgi 2, 3 Valeria Vignudelli 2, 3
1 ENS Lyon - École normale supérieure - Lyon
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
3 UNIBO - Università di Bologna [Bologna]
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.
Keywords : probabilistic lambda calculus bisimulation coinduction sequentiality
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download
https://hal.inria.fr/hal-01229398
Contributor : Vignudelli Valeria <>
Submitted on : Monday, November 16, 2015 - 3:36:49 PM
Last modification on : Wednesday, October 10, 2018 - 10:08:57 AM
Long-term archiving on : Friday, April 28, 2017 - 3:35:14 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

INRIA | ENS-LYON | UNIV-COTEDAZUR

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

181

Files downloads

224

Contact


archive-ouverte@inria.fr