Applicative Bisimulation and Quantum λ-Calculi [chapter]

Ugo Dal Lago, Alessandro Rioli
2015 Lecture Notes in Computer Science  
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
more » ... sults are proofs of soundness for the obtained notions of bisimilarity. © IFIP International Federation for Information Processing 2015 M. Dastani and M.Sirjani (Eds.): FSEN 2015, LNCS 9392, pp. 54-68, 2015.
doi:10.1007/978-3-319-24644-4_4 fatcat:cgxlelylhzc3do6m4af5cbyhai