{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:52:09Z","timestamp":1725882729194},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544334"},{"type":"electronic","value":"9783662544341"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54434-1_13","type":"book-chapter","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:20:06Z","timestamp":1489810806000},"page":"341-367","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Metric Reasoning About $$\\lambda $$-Terms: The General Case"],"prefix":"10.1007","author":[{"given":"Rapha\u00eblle","family":"Crubill\u00e9","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"key":"13_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus - Its Syntax and Semantics","author":"HP Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus - Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1984)"},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139032636","volume-title":"Lambda Calculus with Types. Perspectives in Logic","author":"HP Barendregt","year":"2013","unstructured":"Barendregt, H.P., Dekkers, W., Statman, R.: Lambda Calculus with Types. Perspectives in Logic. Cambridge University Press, Cambridge (2013)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-662-46678-0_18","volume-title":"Foundations of Software Science and Computation Structures","author":"A Bizjak","year":"2015","unstructured":"Bizjak, A., Birkedal, L.: Step-indexed logical relations for probability. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 279\u2013294. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46678-0_18"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-22177-9_24","volume-title":"Fundamentals of Computation Theory","author":"A Cappai","year":"2015","unstructured":"Cappai, A., Dal Lago, U.: On equivalences, metrics, and polynomial time. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 311\u2013323. Springer, Cham (2015). doi:10.1007\/978-3-319-22177-9_24"},{"key":"13_CR5","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 $$\\lambda $$-calculi. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 209\u2013228. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-54833-8_12"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Crubill\u00e9, R., Dal Lago, U.: Metric reasoning about $$\\lambda $$-terms: the affine case. In: Proceedings of LICS, pp. 633\u2013644 (2015)","DOI":"10.1109\/LICS.2015.64"},{"key":"13_CR7","unstructured":"Crubill\u00e9, R., Dal Lago, U.: Metric reasoning about $$\\lambda $$-terms: the general case (long version) (2016). http:\/\/arxiv.org\/abs\/1701.05521"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-23506-6_7","volume-title":"Correct System Design","author":"R Crubill\u00e9","year":"2015","unstructured":"Crubill\u00e9, R., Dal Lago, U., Sangiorgi, D., Vignudelli, V.: On applicative similarity, sequentiality, and full abstraction. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 65\u201382. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23506-6_7"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Sangiorgi, D., Alberti, M.: On coinductive equivalences for higher-order probabilistic functional programs. In: Proceedings of POPL, pp. 297\u2013308 (2014)","DOI":"10.1145\/2578855.2535872"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1051\/ita\/2012012","volume":"46","author":"U Dal Lago","year":"2012","unstructured":"Dal Lago, U., Zorzi, M.: Probabilistic operational semantics for the lambda calculus. RAIRO Theor. Inform. Appl. 46(3), 413\u2013450 (2012)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-48320-9_19","volume-title":"CONCUR\u201999 Concurrency Theory","author":"J Desharnais","year":"1999","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled Markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 258\u2013273. Springer, Heidelberg (1999). doi:10.1007\/3-540-48320-9_19"},{"key":"13_CR12","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proceedings of LICS, pp. 413\u2013422 (2002)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Laviolette, F., Tracol, M.: Approximate analysis of probabilistic processes: logic, simulation and games. In: Proceedings of QEST, pp. 264\u2013273 (2008)","DOI":"10.1109\/QEST.2008.42"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Tasson, C., Pagani, M.: Probabilistic coherence spaces are fully abstract for probabilistic PCF. In: Proceedings of POPL, pp. 309\u2013320 (2014)","DOI":"10.1145\/2578855.2535865"},{"key":"13_CR15","unstructured":"Escardo, M.: A metric model of PCF. In: Proceedings of the Workshop on Realizability Semantics and Applications (1999). http:\/\/www.cs.bham.ac.uk\/~mhe\/papers\/metricpcf.pdf"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-662-46678-0_15","volume-title":"Foundations of Software Science and Computation Structures","author":"D Gebler","year":"2015","unstructured":"Gebler, D., Larsen, K.G., Tini, S.: Compositional metric reasoning with probabilistic process calculi. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 230\u2013245. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46678-0_15"},{"key":"13_CR17","unstructured":"Gebler, D., Tini, S.: SOS specifications of probabilistic systems by uniformly continuous operators. In: Proceedings of CONCUR, pp. 155\u2013168 (2015)"},{"key":"13_CR18","unstructured":"Giacalone, A., Jou, C.C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of IFIP TC2, pp. 443\u2013458. North-Holland (1990)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"13_CR20","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. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR21","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: UAI 2008, pp. 220\u2013229 (2008)"},{"key":"13_CR22","unstructured":"Jones, C., Plotkin, G.D.: A probabilistic powerdomain of evaluations. In: Proceedings of LICS, pp. 186\u2013195 (1989)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/S1571-0661(05)80216-6","volume":"13","author":"A Jung","year":"1998","unstructured":"Jung, A., Tix, R.: The troublesome probabilistic powerdomain. Electron. Notes Theor. Comput. Sci. 13, 70\u201391 (1998)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"volume-title":"Foundations of Statistical Natural Language Processing","year":"1999","author":"CD Manning","key":"13_CR24","unstructured":"Manning, C.D., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing, vol. 999. MIT Press, Cambridge (1999)"},{"key":"13_CR25","unstructured":"Mardare, R.: Logical foundations of metric behavioural theory for Markov processes. Doctoral thesis (2016, in preparation)"},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1452044.1452048","volume":"31","author":"S Park","year":"2008","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based on sampling functions. ACM Trans. Program. Lang. Syst. 31(1), 4 (2008)","journal-title":"ACM Trans. Program. Lang. Syst."},{"volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","year":"1988","author":"J Pearl","key":"13_CR27","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"GD Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 223\u2013255 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: Proceedings of POPL, pp. 154\u2013165 (2002)","DOI":"10.1145\/565816.503288"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-08921-7_92","volume-title":"Mathematical Foundations of Computer Science 1978","author":"N Saheb-Djahromi","year":"1978","unstructured":"Saheb-Djahromi, N.: Probabilistic LCF. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 442\u2013451. Springer, Heidelberg (1978). doi:10.1007\/3-540-08921-7_92"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Math. Struct. Comput. Sci. 8, 447\u2013479 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Vignudelli, V.: Environmental bisimulations for probabilistic higher-order languages. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 595\u2013607 (2016)","DOI":"10.1145\/2837614.2837651"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-32033-3_17","volume-title":"Term Rewriting and Applications","author":"A Simpson","year":"2005","unstructured":"Simpson, A.: Reduction in a linear lambda-calculus with applications to operational semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 219\u2013234. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-32033-3_17"},{"key":"13_CR34","first-page":"1","volume":"1","author":"S Thrun","year":"2002","unstructured":"Thrun, S.: Robotic mapping: a survey. Explor. Artif. Intell. New Millenn. 1, 1\u201335 (2002)","journal-title":"Explor. Artif. Intell. New Millenn."},{"issue":"1\u20132","key":"13_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00403-5","volume":"258","author":"F van Breugel","year":"2001","unstructured":"van Breugel, F.: An introduction to metric semantics: operational and denotational models for programming and specification languages. Theor. Comput. Sci. 258(1\u20132), 1\u201398 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR36","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2004.09.035","volume":"331","author":"F van Breugel","year":"2005","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theor. Comput. Sci. 331(1), 115\u2013142 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54434-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T15:46:03Z","timestamp":1635263163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54434-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544334","9783662544341"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54434-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2017a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}
