{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:57:53Z","timestamp":1742918273692,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319246437"},{"type":"electronic","value":"9783319246444"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24644-4_4","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T05:34:39Z","timestamp":1443072879000},"page":"54-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Applicative Bisimulation and Quantum \u03bb-Calculi"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Rioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"4_CR1","unstructured":"Abramsky, S.: The lazy \u03bb-calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65\u2013117. Addison Wesley (1990)"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0956796899003639","volume":"10","author":"G.M. Bierman","year":"2000","unstructured":"Bierman, G.M.: Program equivalence in a linear functional language. J. Funct. Program.\u00a010(2), 167\u2013190 (2000)","journal-title":"J. Funct. Program."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Crole, R.L.: Completeness of bisimilarity for contextual equivalence in linear theories. Electronic Journal of the IGPL\u00a09(1) (January 2001)","DOI":"10.1093\/jigpal\/9.1.27"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-54833-8_12","volume-title":"Programming Languages and Systems","author":"R. Crubill\u00e9","year":"2014","unstructured":"Crubill\u00e9, R., Dal Lago, U.: On probabilistic applicative bisimulation and call-by-value \u03bb-calculi. In: Shao, Z. (ed.) ESOP 2014 (ETAPS). LNCS, vol.\u00a08410, pp. 209\u2013228. Springer, Heidelberg (2014)"},{"key":"4_CR5","unstructured":"Dal Lago, U., Rioli, A: Applicative bisimulation and quantum \u03bb-calculi (long version) (2014). http:\/\/arxiv.org\/abs\/1506.06661"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1017\/S1744552311000449","volume":"8","author":"T.A.S. Davidson","year":"2012","unstructured":"Davidson, T.A.S., Gay, S.J., Mlnarik, H., Nagarajan, R., Papanikolaou, N.: Model checking for communicating quantum processes. IJUC\u00a08(1), 73\u201398 (2012)","journal-title":"IJUC"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Deng, Y., Feng, Y.: Open bisimulation for quantum processes. CoRR, abs\/1201.0416 (2012)","DOI":"10.1007\/978-3-642-33475-7_9"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Simon, J.: Gay and Rajagopal Nagarajan. Communicating quantum processes. In: POPL, pp. 145\u2013157 (2005)","DOI":"10.1145\/1047659.1040318"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Inf. Comput.\u00a0124(2), 103\u2013112 (1996)","journal-title":"Inf. Comput."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-19805-2_2","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Jacobs","year":"2011","unstructured":"Jacobs, B.: Coalgebraic walks, in quantum and turing computation. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 12\u201326. Springer, Heidelberg (2011)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.entcs.2011.09.023","volume":"276","author":"V. Koutavas","year":"2011","unstructured":"Koutavas, V., Levy, P.B., Sumii, E.: From applicative to environmental bisimulation. Electr. Notes Theor. Comput. Sci.\u00a0276, 215\u2013235 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput.\u00a094(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/S1571-0661(05)80704-2","volume":"10","author":"S.B. Lassen","year":"1997","unstructured":"Lassen, S.B., Pitcher, C.: Similarity and bisimilarity for countable non-determinism and higher-order functions. Electr. Notes Theor. Comput. Sci.\u00a010, 246\u2013266 (1997)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R.: Fully abstract models of typed \u03bb-calculi. Theor. Comput. Sci.\u00a04, 1\u201322 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","unstructured":"Morris, J.: Lambda Calculus Models of Programming Languages. PhD thesis, MIT (1969)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Andrew, M.: Pitts. Operationally-based theories of program equivalence. In: Semantics and Logics of Computation, pp. 241\u2013298. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511526619.007"},{"key":"4_CR17","unstructured":"Plotkin, G.: Lambda definability and logical relations. In: Memo SAI-RM-4, School of Artificial Intelligence, Edinburgh (1973)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge Universtity Press (2012)","DOI":"10.1017\/CBO9780511777110"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11417170_26","volume-title":"Typed Lambda Calculi and Applications","author":"P. Selinger","year":"2005","unstructured":"Selinger, P., Valiron, B.: A Lambda Calculus for Quantum Computation with Classical Control. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 354\u2013368. Springer, Heidelberg (2005)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.entcs.2008.04.022","volume":"210","author":"P. Selinger","year":"2008","unstructured":"Selinger, P., Valiron, B.: On a fully abstract model for a quantum linear functional language. Electron. Notes Theor. Comput. Sci.\u00a0210, 123\u2013137 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1-2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2004.10.021","volume":"333","author":"F. Breugel van","year":"2005","unstructured":"van Breugel, F., Mislove, M.W., Ouaknine, J., Worrell, J.: Domain theory, testing and simulation for labelled Markov processes. Theor. Comput. Sci.\u00a0333(1-2), 171\u2013197 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24644-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T13:41:41Z","timestamp":1692020501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24644-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319246437","9783319246444"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24644-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"12 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}