{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T06:40:12Z","timestamp":1790059212344,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642548321","type":"print"},{"value":"9783642548338","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54833-8_12","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:37:17Z","timestamp":1395394637000},"page":"209-228","source":"Crossref","is-referenced-by-count":28,"title":["On Probabilistic Applicative Bisimulation and Call-by-Value \u03bb-Calculi"],"prefix":"10.1007","author":[{"given":"Rapha\u00eblle","family":"Crubill\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Abramsky, S.: The Lazy \u03bb-Calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65\u2013117. Addison Wesley (1990)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theor. Comput. Sci.\u00a020, 265\u2013321 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TPAMI.2003.1195991","volume":"25","author":"D. Comaniciu","year":"2003","unstructured":"Comaniciu, D., Ramesh, V., Meer, P.: Kernel-based object tracking. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a025(5), 564\u2013577 (2003)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"12_CR4","unstructured":"Crubille, R., Dal Lago, U.: On Probabilistic applicative bisimulation for call-by-value lambda calculi (long version) (2014), http:\/\/arxiv.org\/abs\/1401.3766"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Sangiorgi, D., Alberti, M.: On coinductive equivalences for higher-order probabilistic functional programs. In: POPL, pp. 297\u2013308 (2014)","DOI":"10.1145\/2535838.2535872"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1051\/ita\/2012012","volume":"46","author":"U. Lago Dal","year":"2012","unstructured":"Dal Lago, U., Zorzi, M.: Probabilistic operational semantics for the lambda calculus. RAIRO - Theor. Inf. and Applic.\u00a046(3), 413\u2013450 (2012)","journal-title":"RAIRO - Theor. Inf. and Applic."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/507382.507385","volume":"3","author":"V. Danos","year":"2002","unstructured":"Danos, V., Harmer, R.: Probabilistic game semantics. ACM Trans. Comput. Log.\u00a03(3), 359\u2013382 (2002)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/inco.2001.2962","volume":"179","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled markov processes. Inf. Comput.\u00a0179(2), 163\u2013193 (2002)","journal-title":"Inf. Comput."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Tasson, C., Pagani, M.: Probabilistic coherence spaces are fully abstract for probabilistic PCF. In: POPL, pp. 309\u2013320 (2014)","DOI":"10.1145\/2535838.2535865"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Goodman, N.D.: The principles and practice of probabilistic programming. In: POPL, pp. 399\u2013402 (2013)","DOI":"10.1145\/2480359.2429117"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Aizatulin, M., Borgstr\u00f6m, J., Claret, G., Graepel, T., Nori, A.V., Rajamani, S.K., Russo, C.V.: A model-learner pattern for bayesian reasoning. In: POPL, pp. 403\u2013416 (2013)","DOI":"10.1145\/2480359.2429119"},{"issue":"6","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1017\/S0960129508007172","volume":"18","author":"J. Goubault-Larrecq","year":"2008","unstructured":"Goubault-Larrecq, J., Lasota, S., Nowak, D.: Logical relations for monadic types. Mathematical Structures in Computer Science\u00a018(6), 1169\u20131217 (2008)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"12_CR14","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":"12_CR15","doi-asserted-by":"crossref","unstructured":"Jones, C., Plotkin, G.D.: A probabilistic powerdomain of evaluations. In: LICS, pp. 186\u2013195 (1989)","DOI":"10.1109\/LICS.1989.39173"},{"key":"12_CR16","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall Cryptography and Network Security Series. Chapman & Hall (2007)"},{"issue":"1","key":"12_CR17","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":"12_CR18","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Relational Reasoning about Functions and Nondeterminism. PhD thesis, University of Aarhus (1998)","DOI":"10.7146\/brics.v4i24.18950"},{"key":"12_CR19","unstructured":"Manning, C.D., Sch\u00fctze, H.: Foundations of statistical natural language processing, vol.\u00a0999. MIT Press (1999)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: Non-determinism in a functional setting. In: LICS, pp. 275\u2013286 (1993)","DOI":"10.1109\/LICS.1993.287580"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based on sampling functions. ACM Trans. Program. Lang. Syst.\u00a031(1) (2008)","DOI":"10.1145\/1452044.1452048"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"12_CR23","unstructured":"Pfeffer, A.: IBAL: A probabilistic rational programming language. In: IJCAI, pp. 733\u2013740. Morgan Kaufmann (2001)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Pitts, A.: Operationally-based theories of program equivalence. In: Semantics and Logics of Computation, pp. 241\u2013298. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511526619.007"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci.\u00a05(3), 223\u2013255 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: POPL, pp. 154\u2013165 (2002)","DOI":"10.1145\/565816.503288"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028, 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"12_CR28","unstructured":"Thrun, S.: Robotic mapping: A survey. Exploring artificial intelligence in the new millennium, 1\u201335 (2002)"},{"issue":"1-2","key":"12_CR29","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","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54833-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:45:49Z","timestamp":1746157549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54833-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548321","9783642548338"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54833-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}