| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
Abstract : 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, lambda-calculus. 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.
Cited literature [29 references]
https://hal.inria.fr/hal-01091564
Contributor : Ugo Dal Lago <>
Submitted on : Friday, December 5, 2014 - 4:12:38 PM
Last modification on : Wednesday, November 20, 2019 - 7:38:35 AM
Document(s) archivé(s) le : Monday, March 9, 2015 - 6:04:33 AM
Contributor : Ugo Dal Lago <>
Submitted on : Friday, December 5, 2014 - 4:12:38 PM
Last modification on : Wednesday, November 20, 2019 - 7:38:35 AM
Document(s) archivé(s) le : Monday, March 9, 2015 - 6:04:33 AM
File
main.pdf
Files produced by the author(s)