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.
Origin : Files produced by the author(s)
Loading...