On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (Long Version) release_sjl32ba7nbcspn7zzssvg7j2aq

by Raphaelle Crubille, Ugo Dal Lago

Released as a article .

2014  

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.
In text/plain format

Archived Files and Locations

application/pdf  457.5 kB
file_b6n3scy2vff4nakx3z7ctp2teq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-01-15
Version   v1
Language   en ?
arXiv  1401.3766v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 96a83f40-3276-42cd-872a-6fcdb93b91c6
API URL: JSON