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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abramsky, S.: The lazy λ-calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65–117. Addison Wesley (1990)
Bierman, G.M.: Program equivalence in a linear functional language. J. Funct. Program. 10(2), 167–190 (2000)
Crole, R.L.: Completeness of bisimilarity for contextual equivalence in linear theories. Electronic Journal of the IGPL 9(1) (January 2001)
Crubillé, R., Dal Lago, U.: On probabilistic applicative bisimulation and call-by-value λ-calculi. In: Shao, Z. (ed.) ESOP 2014 (ETAPS). LNCS, vol. 8410, pp. 209–228. Springer, Heidelberg (2014)
Dal Lago, U., Rioli, A: Applicative bisimulation and quantum λ-calculi (long version) (2014). http://arxiv.org/abs/1506.06661
Davidson, T.A.S., Gay, S.J., Mlnarik, H., Nagarajan, R., Papanikolaou, N.: Model checking for communicating quantum processes. IJUC 8(1), 73–98 (2012)
Deng, Y., Feng, Y.: Open bisimulation for quantum processes. CoRR, abs/1201.0416 (2012)
Simon, J.: Gay and Rajagopal Nagarajan. Communicating quantum processes. In: POPL, pp. 145–157 (2005)
Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Inf. Comput. 124(2), 103–112 (1996)
Jacobs, B.: Coalgebraic walks, in quantum and turing computation. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 12–26. Springer, Heidelberg (2011)
Koutavas, V., Levy, P.B., Sumii, E.: From applicative to environmental bisimulation. Electr. Notes Theor. Comput. Sci. 276, 215–235 (2011)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1–28 (1991)
Lassen, S.B., Pitcher, C.: Similarity and bisimilarity for countable non-determinism and higher-order functions. Electr. Notes Theor. Comput. Sci. 10, 246–266 (1997)
Milner, R.: Fully abstract models of typed λ-calculi. Theor. Comput. Sci. 4, 1–22 (1977)
Morris, J.: Lambda Calculus Models of Programming Languages. PhD thesis, MIT (1969)
Andrew, M.: Pitts. Operationally-based theories of program equivalence. In: Semantics and Logics of Computation, pp. 241–298. Cambridge University Press (1997)
Plotkin, G.: Lambda definability and logical relations. In: Memo SAI-RM-4, School of Artificial Intelligence, Edinburgh (1973)
Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge Universtity Press (2012)
Selinger, P., Valiron, B.: A Lambda Calculus for Quantum Computation with Classical Control. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 354–368. Springer, Heidelberg (2005)
Selinger, P., Valiron, B.: On a fully abstract model for a quantum linear functional language. Electron. Notes Theor. Comput. Sci. 210, 123–137 (2008)
van Breugel, F., Mislove, M.W., Ouaknine, J., Worrell, J.: Domain theory, testing and simulation for labelled Markov processes. Theor. Comput. Sci. 333(1-2), 171–197 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Dal Lago, U., Rioli, A. (2015). Applicative Bisimulation and Quantum λ-Calculi. In: Dastani, M., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2015. Lecture Notes in Computer Science(), vol 9392. Springer, Cham. https://doi.org/10.1007/978-3-319-24644-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-24644-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24643-7
Online ISBN: 978-3-319-24644-4
eBook Packages: Computer ScienceComputer Science (R0)