A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
[chapter]
2014
Lecture Notes in Computer Science
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambdacalculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more surprisingly, full-abstraction only holds in a symmetric setting.
doi:10.1007/978-3-642-54833-8_12
fatcat:pm6qbwcv3fclbf535vg6tn7m5m