Abstract : Applicative bisimulation is a coinductive technique to check program equivalence in higher-order functional languages. It is known to be sound — and sometimes complete — with respect to context equivalence. In this paper we show that applicative bisimulation also works when the underlying language of programs takes the form of a linear λ-calculus extended with features such as probabilistic binary choice, but also quantum data, the latter being a setting in which linearity plays a role. The main results are proofs of soundness for the obtained notions of bisimilarity.
Type de document :
Communication dans un congrès
Mehdi Dastani; Marjan Sirjani. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. Springer, Lecture Notes in Computer Science, LNCS-9392, pp.54-68, 2015, Fundamentals of Software Engineering. 〈10.1007/978-3-319-24644-4_4〉
https://hal.inria.fr/hal-01231800
Contributeur : Ugo Dal Lago
<>
Soumis le : vendredi 20 novembre 2015 - 16:54:43
Dernière modification le : mercredi 10 octobre 2018 - 10:09:25
Document(s) archivé(s) le : vendredi 28 avril 2017 - 18:02:52
