{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T21:40:03Z","timestamp":1748554803504,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_24","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"311-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Equivalences, Metrics, and Polynomial Time"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Cappai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"24_CR1","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"S Abramsky","year":"1990","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65\u2013117. Addison Wesley, Boston (1990)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Cappai, A., Dal Lago, U.: On equivalences, metrics, and polynomial time (long version) (2015) http:\/\/arxiv.org\/abs\/1506.03710","DOI":"10.1007\/978-3-319-22177-9_24"},{"key":"24_CR3","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 (ETAPS). LNCS, vol. 8410, pp. 209\u2013228. Springer, Heidelberg (2014)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Sangiorgi, D., Alberti, M.: On coinductive equivalences for higher-order probabilistic functional programs. In: POPL (2014)","DOI":"10.1145\/2535838.2535872"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32495-6_1","volume-title":"Foundational and Practical Aspects of Resource Analysis","author":"U Dal Lago","year":"2012","unstructured":"Dal Lago, U., Parisen Toldin, P.: A higher-order characterization of probabilistic polynomial time. In: Pe\u00f1a, R., van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2011. LNCS, vol. 7177, pp. 1\u201318. Springer, Heidelberg (2012)"},{"issue":"2","key":"24_CR6","first-page":"177","volume":"24","author":"U Dal Lago","year":"2014","unstructured":"Dal Lago, U., Zuppiroli, S., Gabbrielli, M.: Probabilistic recursion theory and implicit computational complexity. Sci. Ann. Comp. Sci. 24(2), 177\u2013216 (2014)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"24_CR7","unstructured":"Deng, Y., Zhang, Y.: Program equivalence in linear contexts. CoRR, abs\/1106.2872 (2011)"},{"key":"24_CR8","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)"},{"key":"24_CR9","series-title":"Basic Techniques","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Techniques, vol. 1. Cambridge University Press, New York (2001)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sudan, M.: Computational indistinguishability: a sample hierarchy. In: CCC, pp. 24\u201333 (1998)","DOI":"10.1109\/CCC.1998.694588"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0028020","volume-title":"Computer Science Logic","author":"M Hofmann","year":"1997","unstructured":"Hofmann, M.: A mixed modal\/linear lambda calculus with applications to bellantoni-cook safe recursion. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 275\u2013294. Springer, Heidelberg (1997)"},{"issue":"1\u20133","key":"24_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0168-0072(00)00010-5","volume":"104","author":"M Hofmann","year":"2000","unstructured":"Hofmann, M.: Safe recursion with higher types and bck-algebra. Ann. Pure Appl. Logic 104(1\u20133), 113\u2013166 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"DJ Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Inf. Comput. 124(2), 103\u2013112 (1996)","journal-title":"Inf. Comput."},{"key":"24_CR14","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall\/CRC Press, Boca Raton (2007)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., Mitchell, M., Scedrov, A.: A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In: FOCS, pp. 725\u2013733 (1998)","DOI":"10.1109\/SFCS.1998.743523"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-16280-0_3","volume-title":"Provable Security","author":"D Nowak","year":"2010","unstructured":"Nowak, D., Zhang, Y.: A calculus for game-based security proofs. In: Heng, S.-H., Kurosawa, K. (eds.) ProvSec 2010. LNCS, vol. 6402, pp. 35\u201352. Springer, Heidelberg (2010)"},{"issue":"5","key":"24_CR17","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1017\/S0960129510000265","volume":"20","author":"Y Zhang","year":"2010","unstructured":"Zhang, Y.: The computational SLR: a logic for reasoning about computational indistinguishability. Mathematical Structures in Computer Science 20(5), 951\u2013975 (2010)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T21:14:10Z","timestamp":1748553250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_24","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":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}